Base | Representation |
---|---|
bin | 10110111110000010010011… |
… | …111001011001101100010000 |
3 | 111020200102120022012111110111 |
4 | 112332002103321121230100 |
5 | 101220103142144200422 |
6 | 554503555425211104 |
7 | 30164314360004542 |
oct | 2676022371315420 |
9 | 436612508174414 |
10 | 101020112100112 |
11 | 2a208430767607 |
12 | b3b645b190a94 |
13 | 444a2040a862a |
14 | 1ad35843a1692 |
15 | ba2b71a46a77 |
hex | 5be093e59b10 |
101020112100112 has 40 divisors (see below), whose sum is σ = 202997761018112. Its totient is φ = 48649037270400.
The previous prime is 101020112100101. The next prime is 101020112100181. The reversal of 101020112100112 is 211001211020101.
It is a happy number.
It is a super-2 number, since 2×1010201121001122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101020112100092 and 101020112100101.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 482524683 + ... + 482733994.
Almost surely, 2101020112100112 is an apocalyptic number.
It is an amenable number.
101020112100112 is an abundant number, since it is smaller than the sum of its proper divisors (101977648918000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101020112100112 is a wasteful number, since it uses less digits than its factorization.
101020112100112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 965258927 (or 965258921 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101020112100112 its reverse (211001211020101), we get a palindrome (312021323120213).
The spelling of 101020112100112 in words is "one hundred one trillion, twenty billion, one hundred twelve million, one hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •