Base | Representation |
---|---|
bin | 1010111010100111000000… |
… | …1101000111000101011110 |
3 | 1120111101022111011010122110 |
4 | 2232221300031013011132 |
5 | 3033120114401010420 |
6 | 41305352525254450 |
7 | 2346055162115553 |
oct | 256516015070536 |
9 | 46441274133573 |
10 | 12002021110110 |
11 | 390803502a839 |
12 | 141a0a4704426 |
13 | 690a2a348725 |
14 | 2d6c881b0a2a |
15 | 15c3005a2ee0 |
hex | aea7034715e |
12002021110110 has 16 divisors (see below), whose sum is σ = 28804850664336. Its totient is φ = 3200538962688.
The previous prime is 12002021110099. The next prime is 12002021110117. The reversal of 12002021110110 is 1101112020021.
12002021110110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12002021110117) 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, 200033685139 + ... + 200033685198.
It is an arithmetic number, because the mean of its divisors is an integer number (1800303166521).
Almost surely, 212002021110110 is an apocalyptic number.
12002021110110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12002021110110 is an abundant number, since it is smaller than the sum of its proper divisors (16802829554226).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12002021110110 is a wasteful number, since it uses less digits than its factorization.
12002021110110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 400067370347.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 12002021110110 its reverse (1101112020021), we get a palindrome (13103133130131).
The spelling of 12002021110110 in words is "twelve trillion, two billion, twenty-one million, one hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •