Base | Representation |
---|---|
bin | 1001000111010100010100… |
… | …1110000011010110010000 |
3 | 1022111000210000121010202220 |
4 | 2101311011032003112100 |
5 | 2303142130410410300 |
6 | 33151421510541040 |
7 | 2053005436434216 |
oct | 221650516032620 |
9 | 38430700533686 |
10 | 10021320013200 |
11 | 321402198a541 |
12 | 115a247967780 |
13 | 579011157552 |
14 | 26906a864cb6 |
15 | 125a26a03da0 |
hex | 91d45383590 |
10021320013200 has 120 divisors (see below), whose sum is σ = 32354397662208. Its totient is φ = 2651309821440.
The previous prime is 10021320013183. The next prime is 10021320013261. The reversal of 10021320013200 is 231002312001.
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 (15).
It is a self number, because there is not a number n which added to its sum of digits gives 10021320013200.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 32725947 + ... + 33030746.
Almost surely, 210021320013200 is an apocalyptic number.
10021320013200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10021320013200 is an abundant number, since it is smaller than the sum of its proper divisors (22333077649008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10021320013200 is a wasteful number, since it uses less digits than its factorization.
10021320013200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65756841 (or 65756830 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 10021320013200 its reverse (231002312001), we get a palindrome (10252322325201).
The spelling of 10021320013200 in words is "ten trillion, twenty-one billion, three hundred twenty million, thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •