Base | Representation |
---|---|
bin | 10010101110000111… |
… | …101001110101001000 |
3 | 1220212212210020121202 |
4 | 102232013221311020 |
5 | 312131341023422 |
6 | 13122340323332 |
7 | 1311060424325 |
oct | 225607516510 |
9 | 56785706552 |
10 | 20101111112 |
11 | 858560a325 |
12 | 3a8b9a3548 |
13 | 1b8461a0b4 |
14 | d898c5b4c |
15 | 7c9a8eb92 |
hex | 4ae1e9d48 |
20101111112 has 32 divisors (see below), whose sum is σ = 37814515200. Its totient is φ = 10017291264.
The previous prime is 20101111099. The next prime is 20101111159. The reversal of 20101111112 is 21111110102.
It is a junction number, because it is equal to n+sod(n) for n = 20101111093 and 20101111102.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4271753 + ... + 4276455.
It is an arithmetic number, because the mean of its divisors is an integer number (1181703600).
Almost surely, 220101111112 is an apocalyptic number.
It is an amenable number.
20101111112 is a deficient number, since it is larger than the sum of its proper divisors (17713404088).
20101111112 is a wasteful number, since it uses less digits than its factorization.
20101111112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6365 (or 6361 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 20101111112 its reverse (21111110102), we get a palindrome (41212221214).
The spelling of 20101111112 in words is "twenty billion, one hundred one million, one hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •