Base | Representation |
---|---|
bin | 1001100011001011100110… |
… | …10101011100100100010100 |
3 | 2202100120202012112210001210 |
4 | 10301211303111130210110 |
5 | 10223031030202041040 |
6 | 112355140342021420 |
7 | 4265126215514031 |
oct | 461456325344424 |
9 | 82316665483053 |
10 | 21000030112020 |
11 | 676707658a5a3 |
12 | 2431b43717870 |
13 | b943a989352b |
14 | 52859a6a2388 |
15 | 2663d4099480 |
hex | 13197355c914 |
21000030112020 has 96 divisors (see below), whose sum is σ = 60882135350400. Its totient is φ = 5402063245824.
The previous prime is 21000030111967. The next prime is 21000030112097. The reversal of 21000030112020 is 2021103000012.
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 = 21000030111987 and 21000030112005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3458830 + ... + 7345989.
It is an arithmetic number, because the mean of its divisors is an integer number (634188909900).
Almost surely, 221000030112020 is an apocalyptic number.
21000030112020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21000030112020 is an abundant number, since it is smaller than the sum of its proper divisors (39882105238380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21000030112020 is a wasteful number, since it uses less digits than its factorization.
21000030112020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10805977 (or 10805975 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 21000030112020 its reverse (2021103000012), we get a palindrome (23021133112032).
The spelling of 21000030112020 in words is "twenty-one trillion, thirty million, one hundred twelve thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •