Base | Representation |
---|---|
bin | 10010101000001001… |
… | …110011010110101000 |
3 | 1220121220102122020100 |
4 | 102220021303112220 |
5 | 311430224323422 |
6 | 13104403025400 |
7 | 1305433534515 |
oct | 225011632650 |
9 | 56556378210 |
10 | 20001011112 |
11 | 853405a755 |
12 | 3a6236b260 |
13 | 1b6996cc24 |
14 | d7a4aa30c |
15 | 7c0dba7ac |
hex | 4a82735a8 |
20001011112 has 24 divisors (see below), whose sum is σ = 54169405290. Its totient is φ = 6667003680.
The previous prime is 20001011089. The next prime is 20001011141. The reversal of 20001011112 is 21111010002.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 19676795076 + 324216036 = 140274^2 + 18006^2 .
It is a tau number, because it is divible by the number of its divisors (24).
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 = 20001011094 and 20001011103.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 138895839 + ... + 138895982.
Almost surely, 220001011112 is an apocalyptic number.
It is an amenable number.
20001011112 is an abundant number, since it is smaller than the sum of its proper divisors (34168394178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20001011112 is a wasteful number, since it uses less digits than its factorization.
20001011112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277791833 (or 277791826 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 20001011112 its reverse (21111010002), we get a palindrome (41112021114).
The spelling of 20001011112 in words is "twenty billion, one million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •