Base | Representation |
---|---|
bin | 1010111011001100111100… |
… | …0010001101000011101101 |
3 | 1120112100121000022222222220 |
4 | 2232303033002031003231 |
5 | 3033301442204133401 |
6 | 41314155053425553 |
7 | 2346565364332032 |
oct | 256631702150355 |
9 | 46470530288886 |
10 | 12012202021101 |
11 | 3911389979967 |
12 | 142006619b2b9 |
13 | 691990668609 |
14 | 2d7572387389 |
15 | 15c6e9299336 |
hex | aeccf08d0ed |
12012202021101 has 8 divisors (see below), whose sum is σ = 16114528683360. Its totient is φ = 7959005019792.
The previous prime is 12012202021097. The next prime is 12012202021121. The reversal of 12012202021101 is 10112020221021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12012202021101 - 22 = 12012202021097 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12012202021121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12282414666 + ... + 12282415643.
It is an arithmetic number, because the mean of its divisors is an integer number (2014316085420).
Almost surely, 212012202021101 is an apocalyptic number.
It is an amenable number.
12012202021101 is a deficient number, since it is larger than the sum of its proper divisors (4102326662259).
12012202021101 is a wasteful number, since it uses less digits than its factorization.
12012202021101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24564830475.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 12012202021101 its reverse (10112020221021), we get a palindrome (22124222242122).
The spelling of 12012202021101 in words is "twelve trillion, twelve billion, two hundred two million, twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •