Base | Representation |
---|---|
bin | 1011000000111101110001… |
… | …1100001111111000000001 |
3 | 1120212211011010120102012211 |
4 | 2300033130130033320001 |
5 | 3041412230031400001 |
6 | 41431451424022121 |
7 | 2360002050426214 |
oct | 260173434177001 |
9 | 46784133512184 |
10 | 12111211200001 |
11 | 394a376a90451 |
12 | 1437298161941 |
13 | 69b10bb02a84 |
14 | 2dc2859a977b |
15 | 160091517351 |
hex | b03dc70fe01 |
12111211200001 has 8 divisors (see below), whose sum is σ = 12241752242400. Its totient is φ = 11981080020672.
The previous prime is 12111211199957. The next prime is 12111211200019. The reversal of 12111211200001 is 10000211211121.
It is a happy number.
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 12111211200001 - 213 = 12111211191809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12111211206001) 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, 102406351 + ... + 102524548.
It is an arithmetic number, because the mean of its divisors is an integer number (1530219030300).
Almost surely, 212111211200001 is an apocalyptic number.
It is an amenable number.
12111211200001 is a deficient number, since it is larger than the sum of its proper divisors (130541042399).
12111211200001 is a wasteful number, since it uses less digits than its factorization.
12111211200001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204931535.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12111211200001 its reverse (10000211211121), we get a palindrome (22111422411122).
It can be divided in two parts, 12111 and 211200001, that added together give a palindrome (211212112).
The spelling of 12111211200001 in words is "twelve trillion, one hundred eleven billion, two hundred eleven million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •