Base | Representation |
---|---|
bin | 10010101110000111… |
… | …101100000001110000 |
3 | 1220212212210200222002 |
4 | 102232013230001300 |
5 | 312131341320422 |
6 | 13122340433132 |
7 | 1311060462503 |
oct | 225607540160 |
9 | 56785720862 |
10 | 20101120112 |
11 | 8585616067 |
12 | 3a8b9a87a8 |
13 | 1b84621218 |
14 | d898c913a |
15 | 7c9a92692 |
hex | 4ae1ec070 |
20101120112 has 40 divisors (see below), whose sum is σ = 40687279776. Its totient is φ = 9602210816.
The previous prime is 20101120111. The next prime is 20101120139. The reversal of 20101120112 is 21102110102.
It is a junction number, because it is equal to n+sod(n) for n = 20101120093 and 20101120102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20101120111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 283508 + ... + 347244.
Almost surely, 220101120112 is an apocalyptic number.
It is an amenable number.
20101120112 is an abundant number, since it is smaller than the sum of its proper divisors (20586159664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20101120112 is a wasteful number, since it uses less digits than its factorization.
20101120112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64625 (or 64619 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 20101120112 its reverse (21102110102), we get a palindrome (41203230214).
The spelling of 20101120112 in words is "twenty billion, one hundred one million, one hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •