Base | Representation |
---|---|
bin | 1001010010111100010011… |
… | …1100001001101111000000 |
3 | 1100012010021020121200021000 |
4 | 2110233010330021233000 |
5 | 2314430133003100112 |
6 | 33423251004532000 |
7 | 2103305453400660 |
oct | 224570474115700 |
9 | 40163236550230 |
10 | 10221031300032 |
11 | 3290795786213 |
12 | 1190aa2851000 |
13 | 591aba6cb117 |
14 | 2749b44701a0 |
15 | 12ad149487dc |
hex | 94bc4f09bc0 |
10221031300032 has 224 divisors, whose sum is σ = 36360532247040. Its totient is φ = 2748512563200.
The previous prime is 10221031300027. The next prime is 10221031300093. The reversal of 10221031300032 is 23000313012201.
It is a tau number, because it is divible by the number of its divisors (224).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 10221031299978 and 10221031300014.
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, 24647094 + ... + 25058357.
Almost surely, 210221031300032 is an apocalyptic number.
10221031300032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10221031300032 is an abundant number, since it is smaller than the sum of its proper divisors (26139500947008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10221031300032 is a wasteful number, since it uses less digits than its factorization.
10221031300032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49705496 (or 49705480 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 10221031300032 its reverse (23000313012201), we get a palindrome (33221344312233).
The spelling of 10221031300032 in words is "ten trillion, two hundred twenty-one billion, thirty-one million, three hundred thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •