Base | Representation |
---|---|
bin | 10010101000001010… |
… | …001011110100010000 |
3 | 1220121220121201200110 |
4 | 102220022023310100 |
5 | 311430241030222 |
6 | 13104405121320 |
7 | 1305434432610 |
oct | 225012136420 |
9 | 56556551613 |
10 | 20001111312 |
11 | 8534118a66 |
12 | 3a623b9240 |
13 | 1b699a6710 |
14 | d7a4d4a40 |
15 | 7c0dda30c |
hex | 4a828bd10 |
20001111312 has 160 divisors (see below), whose sum is σ = 65312541952. Its totient is φ = 5132408832.
The previous prime is 20001111307. The next prime is 20001111343. The reversal of 20001111312 is 21311110002.
It is a super-2 number, since 2×200011113122 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 99738 + ... + 223494.
Almost surely, 220001111312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20001111312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32656270976).
20001111312 is an abundant number, since it is smaller than the sum of its proper divisors (45311430640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20001111312 is a wasteful number, since it uses less digits than its factorization.
20001111312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123825 (or 123819 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 20001111312 its reverse (21311110002), we get a palindrome (41312221314).
The spelling of 20001111312 in words is "twenty billion, one million, one hundred eleven thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •