Base | Representation |
---|---|
bin | 10010101110101101… |
… | …110101011010001010 |
3 | 1220220120121202020200 |
4 | 102232231311122022 |
5 | 312141421320020 |
6 | 13123335033030 |
7 | 1311241461642 |
oct | 225655653212 |
9 | 56816552220 |
10 | 20111120010 |
11 | 8590226143 |
12 | 3a9320b776 |
13 | 1b86712a17 |
14 | d8ad6d522 |
15 | 7ca8ba590 |
hex | 4aeb7568a |
20111120010 has 24 divisors (see below), whose sum is σ = 52288912260. Its totient is φ = 5362965312.
The previous prime is 20111119993. The next prime is 20111120027. The reversal of 20111120010 is 1002111102.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (20111119993) and next prime (20111120027).
It can be written as a sum of positive squares in 2 ways, for example, as 18615054969 + 1496065041 = 136437^2 + 38679^2 .
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 = 20111119974 and 20111120001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 111728355 + ... + 111728534.
Almost surely, 220111120010 is an apocalyptic number.
20111120010 is an abundant number, since it is smaller than the sum of its proper divisors (32177792250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20111120010 is a wasteful number, since it uses less digits than its factorization.
20111120010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223456902 (or 223456899 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 20111120010 its reverse (1002111102), we get a palindrome (21113231112).
The spelling of 20111120010 in words is "twenty billion, one hundred eleven million, one hundred twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •