Base | Representation |
---|---|
bin | 10110101111001101010011… |
… | …010110101001110101010100 |
3 | 111010002000101010120001020010 |
4 | 112233031103112221311110 |
5 | 101101404244213001322 |
6 | 552403514203040220 |
7 | 30030562012035006 |
oct | 2657152326516524 |
9 | 433060333501203 |
10 | 100001122000212 |
11 | 29955268388584 |
12 | b270a79510070 |
13 | 43a50b072a5b4 |
14 | 1a9a119c3a376 |
15 | b863d304e20c |
hex | 5af3535a9d54 |
100001122000212 has 24 divisors (see below), whose sum is σ = 233372679978816. Its totient is φ = 33328460384128.
The previous prime is 100001122000193. The next prime is 100001122000249. The reversal of 100001122000212 is 212000221100001.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 655789248 + ... + 655941719.
It is an arithmetic number, because the mean of its divisors is an integer number (9723861665784).
Almost surely, 2100001122000212 is an apocalyptic number.
100001122000212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100001122000212 is an abundant number, since it is smaller than the sum of its proper divisors (133371557978604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100001122000212 is a wasteful number, since it uses less digits than its factorization.
100001122000212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1311737327 (or 1311737325 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 100001122000212 its reverse (212000221100001), we get a palindrome (312001343100213).
The spelling of 100001122000212 in words is "one hundred trillion, one billion, one hundred twenty-two million, two hundred twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •