Base | Representation |
---|---|
bin | 10110101111010101101011… |
… | …001101001010011101110100 |
3 | 111010002212120200000102222210 |
4 | 112233111223031022131310 |
5 | 101102031202144201322 |
6 | 552412002232053420 |
7 | 30031330544444046 |
oct | 2657255315123564 |
9 | 433085520012883 |
10 | 100010112100212 |
11 | 29959061027796 |
12 | b272768234270 |
13 | 43a5bb41226b2 |
14 | 1a9a72dbd5a96 |
15 | b8675c42270c |
hex | 5af56b34a774 |
100010112100212 has 48 divisors (see below), whose sum is σ = 237832809984000. Its totient is φ = 32702011261920.
The previous prime is 100010112100207. The next prime is 100010112100271. The reversal of 100010112100212 is 212001211010001.
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 15 ways as a sum of consecutive naturals, for example, 294762012 + ... + 295101107.
It is an arithmetic number, because the mean of its divisors is an integer number (4954850208000).
Almost surely, 2100010112100212 is an apocalyptic number.
100010112100212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100010112100212 is an abundant number, since it is smaller than the sum of its proper divisors (137822697883788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100010112100212 is a wasteful number, since it uses less digits than its factorization.
100010112100212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 589863396 (or 589863394 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100010112100212 its reverse (212001211010001), we get a palindrome (312011323110213).
The spelling of 100010112100212 in words is "one hundred trillion, ten billion, one hundred twelve million, one hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •