Base | Representation |
---|---|
bin | 1001000111010011001101… |
… | …0110000011100001110000 |
3 | 1022111000000010022001021210 |
4 | 2101310303112003201300 |
5 | 2303141022122334300 |
6 | 33151332035120120 |
7 | 2052665135414424 |
oct | 221646326034160 |
9 | 38430003261253 |
10 | 10021020121200 |
11 | 321398867a210 |
12 | 115a183443040 |
13 | 578c93c9696a |
14 | 26903cabcb84 |
15 | 125a0a517050 |
hex | 91d33583870 |
10021020121200 has 120 divisors (see below), whose sum is σ = 35018910360576. Its totient is φ = 2429338208000.
The previous prime is 10021020121199. The next prime is 10021020121213. The reversal of 10021020121200 is 212102012001.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 379570896 + ... + 379597295.
Almost surely, 210021020121200 is an apocalyptic number.
10021020121200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10021020121200 is an abundant number, since it is smaller than the sum of its proper divisors (24997890239376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10021020121200 is a wasteful number, since it uses less digits than its factorization.
10021020121200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 759168223 (or 759168212 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10021020121200 its reverse (212102012001), we get a palindrome (10233122133201).
The spelling of 10021020121200 in words is "ten trillion, twenty-one billion, twenty million, one hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •