Base | Representation |
---|---|
bin | 10010101000101100… |
… | …011110100101111000 |
3 | 1220122112112110101000 |
4 | 102220230132211320 |
5 | 311440041213422 |
6 | 13105325525000 |
7 | 1305604024131 |
oct | 225054364570 |
9 | 56575473330 |
10 | 20010101112 |
11 | 85391a9151 |
12 | 3a65413760 |
13 | 1b6b803521 |
14 | d7b794c88 |
15 | 7c1ab3cac |
hex | 4a8b1e978 |
20010101112 has 64 divisors (see below), whose sum is σ = 55597593600. Its totient is φ = 6668356320.
The previous prime is 20010101099. The next prime is 20010101129. The reversal of 20010101112 is 21110101002.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 20010101094 and 20010101103.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 1089687 + ... + 1107897.
It is an arithmetic number, because the mean of its divisors is an integer number (868712400).
Almost surely, 220010101112 is an apocalyptic number.
It is an amenable number.
20010101112 is an abundant number, since it is smaller than the sum of its proper divisors (35587492488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20010101112 is a wasteful number, since it uses less digits than its factorization.
20010101112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23313 (or 23303 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 20010101112 its reverse (21110101002), we get a palindrome (41120202114).
The spelling of 20010101112 in words is "twenty billion, ten million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •