Base | Representation |
---|---|
bin | 1001101011111010011001… |
… | …10101110101001111101000 |
3 | 2210102021002212000210000010 |
4 | 10311331030311311033220 |
5 | 10242434431143013000 |
6 | 113145033303411520 |
7 | 4325606435504544 |
oct | 465751465651750 |
9 | 83367085023003 |
10 | 21300032001000 |
11 | 6872324857035 |
12 | 2480109753ba0 |
13 | bb6779c03b7c |
14 | 538cd9b76a24 |
15 | 26e0e19ccd50 |
hex | 135f4cd753e8 |
21300032001000 has 128 divisors (see below), whose sum is σ = 66545549740800. Its totient is φ = 5672363244800.
The previous prime is 21300032000999. The next prime is 21300032001007. The reversal of 21300032001000 is 10023000312.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (21300032001007) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2548935 + ... + 7006934.
It is an arithmetic number, because the mean of its divisors is an integer number (519887107350).
Almost surely, 221300032001000 is an apocalyptic number.
21300032001000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21300032001000 is an abundant number, since it is smaller than the sum of its proper divisors (45245517739800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21300032001000 is a wasteful number, since it uses less digits than its factorization.
21300032001000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9556636 (or 9556622 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 21300032001000 its reverse (10023000312), we get a palindrome (21310055001312).
The spelling of 21300032001000 in words is "twenty-one trillion, three hundred billion, thirty-two million, one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •