Base | Representation |
---|---|
bin | 1010111011001000011110… |
… | …0000100010001000111101 |
3 | 1120112020111101022020021120 |
4 | 2232302013200202020331 |
5 | 3033242013003342341 |
6 | 41313440025221153 |
7 | 2346523553405622 |
oct | 256620740421075 |
9 | 46466441266246 |
10 | 12011002012221 |
11 | 3910923567493 |
12 | 141b9903317b9 |
13 | 69182bb700a4 |
14 | 2d749ac54349 |
15 | 15c678c5b066 |
hex | aec8782223d |
12011002012221 has 16 divisors (see below), whose sum is σ = 16207173619200. Its totient is φ = 7911222142208.
The previous prime is 12011002012153. The next prime is 12011002012253. The reversal of 12011002012221 is 12221020011021.
It is a cyclic number.
It is not a de Polignac number, because 12011002012221 - 235 = 11976642273853 is a prime.
It is a super-2 number, since 2×120110020122212 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12011002012221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12011002017221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17105421 + ... + 17793746.
It is an arithmetic number, because the mean of its divisors is an integer number (1012948351200).
Almost surely, 212011002012221 is an apocalyptic number.
It is an amenable number.
12011002012221 is a deficient number, since it is larger than the sum of its proper divisors (4196171606979).
12011002012221 is a wasteful number, since it uses less digits than its factorization.
12011002012221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34900548.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 12011002012221 its reverse (12221020011021), we get a palindrome (24232022023242).
The spelling of 12011002012221 in words is "twelve trillion, eleven billion, two million, twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •