#include #include using namespace std; /* Enter a possitive integer, and see the interesting information about it. */ bool isPrime(int); int length(int); void num_Array(int, int); void sort_Num_Asc(int, int); void sort_Num_Dis(int, int); void reverse_Num(int); bool isPal(int); bool isPerf(int); int n1[20]; int main() { int n, max_Index; cout<<"|^\\_/\\_/^\\_/ WELCOME \\_/^\\_/\\_/^|\n\n"; if(cin>>n) { max_Index=length(n); cout<<"Your number is: "<0) { if(isPrime(n)) { cout<<"Your number is a prime number!\n\n"; } else cout<<"Your number is a composite(non-prime) number!\n\n"; cout<<"Your number divided into digits: "; num_Array(n, max_Index); cout<<"Your number in Ascending order: "; sort_Num_Asc(n, max_Index); cout<<"Your number in Discending order: "; sort_Num_Dis(n, max_Index); cout<<"Your number reversed: "; reverse_Num(n); if(isPal(n)) { cout<<"Your number is a Palindrom! What a coincidence(or maybe not)!\n\n"; } if(isPerf(n)) { cout<<"AMAZING! Your number is a Perfect number even. You really know how to pick a great number!\n\n"; } } else { cout<<"You number is negative. That's all I want to tell you about your number. *-*\n"; cout<<"Enter a possitive number please.\n\n"; } } else { cout<<"Your input is invalid. Please enter a number.\n\n"; } cout<<"|^\\_/^\\_/\\_/^\\_/\\_/^\\_/\\_/^\\_/^|"; return 0; } void reverse_Num(int num) { int num_Reversed = 0; int remainder; while(num>0) { remainder = num%10; num_Reversed = num_Reversed*10 + remainder; num /= 10; } cout<n1[j+1]) { swap=n1[j]; n1[j]=n1[j+1]; n1[j+1]=swap; } } } for(int i=0; i

Information about your Number