Base | Representation |
---|---|
bin | 1001000110011001100110… |
… | …01110001110101000000001 |
3 | 2121212001011210122121000100 |
4 | 10203030303032032220001 |
5 | 10110330224133000001 |
6 | 110320551122513013 |
7 | 4133520003326223 |
oct | 443146316165001 |
9 | 77761153577010 |
10 | 20011112000001 |
11 | 6415735043111 |
12 | 22b2354b05769 |
13 | b22069493b75 |
14 | 4d2785d64413 |
15 | 24a80569a586 |
hex | 12333338ea01 |
20011112000001 has 24 divisors (see below), whose sum is σ = 29063123945856. Its totient is φ = 13267901966400.
The previous prime is 20011111999987. The next prime is 20011112000003. The reversal of 20011112000001 is 10000021111002.
It is a happy number.
It is not a de Polignac number, because 20011112000001 - 218 = 20011111737857 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (20011112000003) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 5610885 + ... + 8456018.
It is an arithmetic number, because the mean of its divisors is an integer number (1210963497744).
Almost surely, 220011112000001 is an apocalyptic number.
It is an amenable number.
20011112000001 is a deficient number, since it is larger than the sum of its proper divisors (9052011945855).
20011112000001 is a wasteful number, since it uses less digits than its factorization.
20011112000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14067773 (or 14067770 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 20011112000001 its reverse (10000021111002), we get a palindrome (30011133111003).
The spelling of 20011112000001 in words is "twenty trillion, eleven billion, one hundred twelve million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •