Base | Representation |
---|---|
bin | 1001100011110010101011… |
… | …11101011010101010110000 |
3 | 2202102120220110212201022002 |
4 | 10301321111331122222300 |
5 | 10223402013100010000 |
6 | 112412530351033132 |
7 | 4266501163533560 |
oct | 461712575325260 |
9 | 82376813781262 |
10 | 21021012110000 |
11 | 6774a633571a1 |
12 | 243601a50b7a8 |
13 | b96371844456 |
14 | 5295cb16ada0 |
15 | 266c1113c8d5 |
hex | 131e55f5aab0 |
21021012110000 has 400 divisors, whose sum is σ = 60074566035264. Its totient is φ = 6974263296000.
The previous prime is 21021012109969. The next prime is 21021012110017. The reversal of 21021012110000 is 1121012012.
It is a tau number, because it is divible by the number of its divisors (400).
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 270791192 + ... + 270868808.
Almost surely, 221021012110000 is an apocalyptic number.
21021012110000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21021012110000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30037283017632).
21021012110000 is an abundant number, since it is smaller than the sum of its proper divisors (39053553925264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21021012110000 is an equidigital number, since it uses as much as digits as its factorization.
21021012110000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77778 (or 77757 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 21021012110000 its reverse (1121012012), we get a palindrome (21022133122012).
The spelling of 21021012110000 in words is "twenty-one trillion, twenty-one billion, twelve million, one hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •