Base | Representation |
---|---|
bin | 1001100011011110001011… |
… | …10001000111110001110000 |
3 | 2202101112111020100200000220 |
4 | 10301233011301013301300 |
5 | 10223211441234030300 |
6 | 112403510120213040 |
7 | 4265631314115006 |
oct | 461570561076160 |
9 | 82345436320026 |
10 | 21010003033200 |
11 | 6770323a89915 |
12 | 2433a6760a180 |
13 | b95308a8c51c |
14 | 528c64db6a76 |
15 | 2667b98a8da0 |
hex | 131bc5c47c70 |
21010003033200 has 120 divisors (see below), whose sum is σ = 67319240148528. Its totient is φ = 5601235875840.
The previous prime is 21010003033189. The next prime is 21010003033223. The reversal of 21010003033200 is 233030001012.
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 21010003033200.
It is a congruent number.
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, 2465484 + ... + 6935316.
Almost surely, 221010003033200 is an apocalyptic number.
21010003033200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21010003033200 is an abundant number, since it is smaller than the sum of its proper divisors (46309237115328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21010003033200 is a wasteful number, since it uses less digits than its factorization.
21010003033200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4473771 (or 4473760 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 21010003033200 its reverse (233030001012), we get a palindrome (21243033034212).
The spelling of 21010003033200 in words is "twenty-one trillion, ten billion, three million, thirty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •