Base | Representation |
---|---|
bin | 1001001001010001110010… |
… | …11101110101011001111110 |
3 | 2122012111102112202101200000 |
4 | 10210220321131311121332 |
5 | 10113440240224031420 |
6 | 110434223521215130 |
7 | 4143620400064635 |
oct | 444507135653176 |
9 | 78174375671600 |
10 | 20110001002110 |
11 | 6453670332038 |
12 | 23095527914a6 |
13 | b2b498a71ab6 |
14 | 4d748762251c |
15 | 24d1920ca690 |
hex | 124a3977567e |
20110001002110 has 48 divisors (see below), whose sum is σ = 54222521227056. Its totient is φ = 5362666933248.
The previous prime is 20110001002097. The next prime is 20110001002129. The reversal of 20110001002110 is 1120010001102.
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 = 20110001002092 and 20110001002101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4137857859 + ... + 4137862718.
It is an arithmetic number, because the mean of its divisors is an integer number (1129635858897).
Almost surely, 220110001002110 is an apocalyptic number.
20110001002110 is an abundant number, since it is smaller than the sum of its proper divisors (34112520224946).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20110001002110 is an equidigital number, since it uses as much as digits as its factorization.
20110001002110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8275720599 (or 8275720587 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 20110001002110 its reverse (1120010001102), we get a palindrome (21230011003212).
The spelling of 20110001002110 in words is "twenty trillion, one hundred ten billion, one million, two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •