Base | Representation |
---|---|
bin | 1010111010100011001101… |
… | …1101111100010001101110 |
3 | 1120111021200110201200011210 |
4 | 2232220303131330101232 |
5 | 3033111023020041420 |
6 | 41305103444455250 |
7 | 2346021006561114 |
oct | 256506335742156 |
9 | 46437613650153 |
10 | 12001002112110 |
11 | 3907661910530 |
12 | 1419a5b3aa526 |
13 | 6908c71b922b |
14 | 2d6bccb19ab4 |
15 | 15c290dbc9e0 |
hex | aea3377c46e |
12001002112110 has 128 divisors (see below), whose sum is σ = 31509816459264. Its totient is φ = 2901095516160.
The previous prime is 12001002112091. The next prime is 12001002112133. The reversal of 12001002112110 is 1121120010021.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 831259812 + ... + 831274248.
It is an arithmetic number, because the mean of its divisors is an integer number (246170441088).
Almost surely, 212001002112110 is an apocalyptic number.
12001002112110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 12001002112110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15754908229632).
12001002112110 is an abundant number, since it is smaller than the sum of its proper divisors (19508814347154).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12001002112110 is a wasteful number, since it uses less digits than its factorization.
12001002112110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21418.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 12001002112110 its reverse (1121120010021), we get a palindrome (13122122122131).
The spelling of 12001002112110 in words is "twelve trillion, one billion, two million, one hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •