Base | Representation |
---|---|
bin | 1010111011001000110111… |
… | …1100111011111100000101 |
3 | 1120112020202220201201221121 |
4 | 2232302031330323330011 |
5 | 3033242223142334341 |
6 | 41313454450313541 |
7 | 2346526335333331 |
oct | 256621574737405 |
9 | 46466686651847 |
10 | 12011110121221 |
11 | 3910979597372 |
12 | 141ba005888b1 |
13 | 691848392803 |
14 | 2d74ab3567c1 |
15 | 15c6834b34d1 |
hex | aec8df3bf05 |
12011110121221 has 2 divisors, whose sum is σ = 12011110121222. Its totient is φ = 12011110121220.
The previous prime is 12011110121203. The next prime is 12011110121243. The reversal of 12011110121221 is 12212101111021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10924280936100 + 1086829185121 = 3305190^2 + 1042511^2 .
It is a cyclic number.
It is not a de Polignac number, because 12011110121221 - 217 = 12011109990149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12011110121195 and 12011110121204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12011110121201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6005555060610 + 6005555060611.
It is an arithmetic number, because the mean of its divisors is an integer number (6005555060611).
Almost surely, 212011110121221 is an apocalyptic number.
It is an amenable number.
12011110121221 is a deficient number, since it is larger than the sum of its proper divisors (1).
12011110121221 is an equidigital number, since it uses as much as digits as its factorization.
12011110121221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 12011110121221 its reverse (12212101111021), we get a palindrome (24223211232242).
The spelling of 12011110121221 in words is "twelve trillion, eleven billion, one hundred ten million, one hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •