Base | Representation |
---|---|
bin | 101110101010001100… |
… | …0101011001001000000 |
3 | 100120122002222111120100 |
4 | 1131110120223021000 |
5 | 3120202200031422 |
6 | 114010425442400 |
7 | 10145022652020 |
oct | 1352430531100 |
9 | 316562874510 |
10 | 100200002112 |
11 | 3954931a701 |
12 | 17504940400 |
13 | 95ab0979a2 |
14 | 4bc7843a80 |
15 | 2916a947ac |
hex | 175462b240 |
100200002112 has 84 divisors (see below), whose sum is σ = 328234543936. Its totient is φ = 28628570880.
The previous prime is 100200002087. The next prime is 100200002183. The reversal of 100200002112 is 211200002001.
100200002112 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (84).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100200002094 and 100200002103.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12421564 + ... + 12429627.
Almost surely, 2100200002112 is an apocalyptic number.
100200002112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100200002112 is an abundant number, since it is smaller than the sum of its proper divisors (228034541824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100200002112 is a wasteful number, since it uses less digits than its factorization.
100200002112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24851216 (or 24851203 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 100200002112 its reverse (211200002001), we get a palindrome (311400004113).
The spelling of 100200002112 in words is "one hundred billion, two hundred million, two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •