Base | Representation |
---|---|
bin | 10110110000101011010110… |
… | …110100111101111110000000 |
3 | 111010102200001022002002202011 |
4 | 112300223112310331332000 |
5 | 101110033111133310422 |
6 | 552522135253302304 |
7 | 30041065436665522 |
oct | 2660532664757600 |
9 | 433380038062664 |
10 | 100102112010112 |
11 | 29994081633783 |
12 | b288562934994 |
13 | 43b1786389cc4 |
14 | 1aa0d7a567a12 |
15 | b88d44145077 |
hex | 5b0ad6d3df80 |
100102112010112 has 16 divisors (see below), whose sum is σ = 199422176270400. Its totient is φ = 50051056004992.
The previous prime is 100102112010079. The next prime is 100102112010127. The reversal of 100102112010112 is 211010211201001.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (16).
It is a super-2 number, since 2×1001021120101122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100102112010092 and 100102112010101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 391023874912 + ... + 391023875167.
It is an arithmetic number, because the mean of its divisors is an integer number (12463886016900).
Almost surely, 2100102112010112 is an apocalyptic number.
It is an amenable number.
100102112010112 is a deficient number, since it is larger than the sum of its proper divisors (99320064260288).
100102112010112 is an frugal number, since it uses more digits than its factorization.
100102112010112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 782047750093 (or 782047750081 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 100102112010112 its reverse (211010211201001), we get a palindrome (311112323211113).
The spelling of 100102112010112 in words is "one hundred trillion, one hundred two billion, one hundred twelve million, ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •