Base | Representation |
---|---|
bin | 1001000110101100001101… |
… | …00011011011011101010110 |
3 | 2121212222221212211121202100 |
4 | 10203112012203123131112 |
5 | 10111011203100013420 |
6 | 110325322200222530 |
7 | 4134322344045045 |
oct | 443260643333526 |
9 | 77788855747670 |
10 | 20021100001110 |
11 | 64199a000218a |
12 | 22b4281a6aa46 |
13 | b22c9b83c9b0 |
14 | 4d305268255c |
15 | 24abdc488190 |
hex | 1235868db756 |
20021100001110 has 96 divisors (see below), whose sum is σ = 57362779682208. Its totient is φ = 4813659809280.
The previous prime is 20021100001037. The next prime is 20021100001127. The reversal of 20021100001110 is 1110000112002.
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 = 20021100001092 and 20021100001101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 198927031 + ... + 199027650.
It is an arithmetic number, because the mean of its divisors is an integer number (597528955023).
Almost surely, 220021100001110 is an apocalyptic number.
20021100001110 is an abundant number, since it is smaller than the sum of its proper divisors (37341679681098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20021100001110 is a wasteful number, since it uses less digits than its factorization.
20021100001110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 397954750 (or 397954747 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 20021100001110 its reverse (1110000112002), we get a palindrome (21131100113112).
The spelling of 20021100001110 in words is "twenty trillion, twenty-one billion, one hundred million, one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.647 sec. • engine limits •