Base | Representation |
---|---|
bin | 10110110010011010001011… |
… | …101010101110111001001100 |
3 | 111010212001012111000102101212 |
4 | 112302122023222232321030 |
5 | 101114010313142320022 |
6 | 553052535315553552 |
7 | 30052510352145530 |
oct | 2662321352567114 |
9 | 433761174012355 |
10 | 100221110120012 |
11 | 29a2a5969a3a52 |
12 | b2a7632bbb8b8 |
13 | 43bca6bb24a9b |
14 | 1aa6a287cdbc0 |
15 | b8beab1943e2 |
hex | 5b268baaee4c |
100221110120012 has 12 divisors (see below), whose sum is σ = 200442220240080. Its totient is φ = 42951904337136.
The previous prime is 100221110120003. The next prime is 100221110120017. The reversal of 100221110120012 is 210021011122001.
100221110120012 is an admirable number.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is not an unprimeable number, because it can be changed into a prime (100221110120017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1789662680687 + ... + 1789662680742.
It is an arithmetic number, because the mean of its divisors is an integer number (16703518353340).
Almost surely, 2100221110120012 is an apocalyptic number.
It is an amenable number.
100221110120012 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100221110120012 is a wasteful number, since it uses less digits than its factorization.
100221110120012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3579325361440 (or 3579325361438 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 100221110120012 its reverse (210021011122001), we get a palindrome (310242121242013).
The spelling of 100221110120012 in words is "one hundred trillion, two hundred twenty-one billion, one hundred ten million, one hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •