Base | Representation |
---|---|
bin | 1001100011001011110010… |
… | …10110101110010010000100 |
3 | 2202100121000020121000021110 |
4 | 10301211321112232102010 |
5 | 10223031232031010040 |
6 | 112355154350445020 |
7 | 4265131553133606 |
oct | 461457126562204 |
9 | 82317006530243 |
10 | 21000131110020 |
11 | 67671185a2917 |
12 | 2431b71503770 |
13 | b943c479636a |
14 | 5285a9c73176 |
15 | 2663dcd99980 |
hex | 1319795ae484 |
21000131110020 has 48 divisors (see below), whose sum is σ = 58832835864768. Its totient is φ = 5596942700160.
The previous prime is 21000131109977. The next prime is 21000131110061. The reversal of 21000131110020 is 2001113100012.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 21000131109978 and 21000131110005.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 96523639 + ... + 96740958.
It is an arithmetic number, because the mean of its divisors is an integer number (1225684080516).
Almost surely, 221000131110020 is an apocalyptic number.
21000131110020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21000131110020 is an abundant number, since it is smaller than the sum of its proper divisors (37832704754748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21000131110020 is a wasteful number, since it uses less digits than its factorization.
21000131110020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193266420 (or 193266418 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 21000131110020 its reverse (2001113100012), we get a palindrome (23001244210032).
The spelling of 21000131110020 in words is "twenty-one trillion, one hundred thirty-one million, one hundred ten thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •