Base | Representation |
---|---|
bin | 10110101111010111011101… |
… | …000011010011111010100100 |
3 | 111010010001111210001111201010 |
4 | 112233113131003103322210 |
5 | 101102044110130320400 |
6 | 552412515542302220 |
7 | 30031426066365126 |
oct | 2657273503237244 |
9 | 433101453044633 |
10 | 100012022120100 |
11 | 299599511a6a22 |
12 | b272bbba27970 |
13 | 43a6129a53b8c |
14 | 1a9a87174b216 |
15 | b8681ee5e450 |
hex | 5af5dd0d3ea4 |
100012022120100 has 72 divisors (see below), whose sum is σ = 304598018263840. Its totient is φ = 25266195060480.
The previous prime is 100012022120089. The next prime is 100012022120111. The reversal of 100012022120100 is 1021220210001.
It is an interprime number because it is at equal distance from previous prime (100012022120089) and next prime (100012022120111).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8772978697 + ... + 8772990096.
Almost surely, 2100012022120100 is an apocalyptic number.
100012022120100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100012022120100 is an abundant number, since it is smaller than the sum of its proper divisors (204585996143740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100012022120100 is a wasteful number, since it uses less digits than its factorization.
100012022120100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17545968829 (or 17545968822 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 100012022120100 its reverse (1021220210001), we get a palindrome (101033242330101).
The spelling of 100012022120100 in words is "one hundred trillion, twelve billion, twenty-two million, one hundred twenty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •