Base | Representation |
---|---|
bin | 10110111111010110000010… |
… | …110100110100110101011000 |
3 | 111021000000122010210002111202 |
4 | 112333112002310310311120 |
5 | 101223041310110013422 |
6 | 555013145115413332 |
7 | 30203646360364103 |
oct | 2677260264646530 |
9 | 437000563702452 |
10 | 101110020001112 |
11 | 2a2425783a3321 |
12 | b40b971154248 |
13 | 4455831ac2455 |
14 | 1ad7a72d6773a |
15 | ba5184c7eb92 |
hex | 5bf582d34d58 |
101110020001112 has 16 divisors (see below), whose sum is σ = 192410858958360. Its totient is φ = 49800457612224.
The previous prime is 101110020001061. The next prime is 101110020001127. The reversal of 101110020001112 is 211100020011101.
It is a super-2 number, since 2×1011100200011122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101110020001093 and 101110020001102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 94319047973 + ... + 94319049044.
Almost surely, 2101110020001112 is an apocalyptic number.
It is an amenable number.
101110020001112 is a deficient number, since it is larger than the sum of its proper divisors (91300838957248).
101110020001112 is a wasteful number, since it uses less digits than its factorization.
101110020001112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188638097090 (or 188638097086 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101110020001112 its reverse (211100020011101), we get a palindrome (312210040012213).
The spelling of 101110020001112 in words is "one hundred one trillion, one hundred ten billion, twenty million, one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •