Base | Representation |
---|---|
bin | 1010111010100111011000… |
… | …1101111110111010111110 |
3 | 1120111101120111222222110012 |
4 | 2232221312031332322332 |
5 | 3033120321213031420 |
6 | 41305410531543222 |
7 | 2346060525514412 |
oct | 256516615767276 |
9 | 46441514888405 |
10 | 12002122002110 |
11 | 3908086a80459 |
12 | 141a11245ab12 |
13 | 690a45212236 |
14 | 2d6c97754d42 |
15 | 15c309381dc5 |
hex | aea7637eebe |
12002122002110 has 128 divisors (see below), whose sum is σ = 23161411728000. Its totient is φ = 4464979200000.
The previous prime is 12002122002097. The next prime is 12002122002119. The reversal of 12002122002110 is 1120022120021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12002122002119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1212208160 + ... + 1212218060.
It is an arithmetic number, because the mean of its divisors is an integer number (180948529125).
Almost surely, 212002122002110 is an apocalyptic number.
12002122002110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12002122002110 is a deficient number, since it is larger than the sum of its proper divisors (11159289725890).
12002122002110 is a wasteful number, since it uses less digits than its factorization.
12002122002110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10558.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 12002122002110 its reverse (1120022120021), we get a palindrome (13122144122131).
The spelling of 12002122002110 in words is "twelve trillion, two billion, one hundred twenty-two million, two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •