Base | Representation |
---|---|
bin | 1010111010111000000100… |
… | …1100110011100101100011 |
3 | 1120111211010200102022211112 |
4 | 2232232001030303211203 |
5 | 3033204004402211321 |
6 | 41311431220533535 |
7 | 2346306525250226 |
oct | 256560114634543 |
9 | 46454120368745 |
10 | 12006601210211 |
11 | 3909a7540a833 |
12 | 141ab625512ab |
13 | 6912aa1b902a |
14 | 2d71a05ab5bd |
15 | 15c4bc714a5b |
hex | aeb81333963 |
12006601210211 has 8 divisors (see below), whose sum is σ = 12077035676160. Its totient is φ = 11936367127872.
The previous prime is 12006601210189. The next prime is 12006601210277. The reversal of 12006601210211 is 11201210660021.
12006601210211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12006601210211 - 26 = 12006601210147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12006601210111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49975715 + ... + 50215388.
It is an arithmetic number, because the mean of its divisors is an integer number (1509629459520).
Almost surely, 212006601210211 is an apocalyptic number.
12006601210211 is a deficient number, since it is larger than the sum of its proper divisors (70434465949).
12006601210211 is a wasteful number, since it uses less digits than its factorization.
12006601210211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100191805.
The product of its (nonzero) digits is 288, while the sum is 23.
Adding to 12006601210211 its reverse (11201210660021), we get a palindrome (23207811870232).
The spelling of 12006601210211 in words is "twelve trillion, six billion, six hundred one million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •