Base | Representation |
---|---|
bin | 1100001110010100100… |
… | …1111110111111110000 |
3 | 202002001110202021000000 |
4 | 3003211021332333300 |
5 | 11420041233430000 |
6 | 240250221430000 |
7 | 21113033205531 |
oct | 3034511767760 |
9 | 662043667000 |
10 | 210003030000 |
11 | 81075265745 |
12 | 3484970b300 |
13 | 16a5982a83a |
14 | a2427d2688 |
15 | 56e1730000 |
hex | 30e527eff0 |
210003030000 has 350 divisors, whose sum is σ = 762335243384. Its totient is φ = 55998864000.
The previous prime is 210003029989. The next prime is 210003030001. The reversal of 210003030000 is 30300012.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210003030001) by changing a digit.
It is a polite number, since it can be written in 69 ways as a sum of consecutive naturals, for example, 7275597 + ... + 7304403.
Almost surely, 2210003030000 is an apocalyptic number.
210003030000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 210003030000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (381167621692).
210003030000 is an abundant number, since it is smaller than the sum of its proper divisors (552332213384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210003030000 is an frugal number, since it uses more digits than its factorization.
210003030000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28853 (or 28817 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 9.
Adding to 210003030000 its reverse (30300012), we get a palindrome (210033330012).
The spelling of 210003030000 in words is "two hundred ten billion, three million, thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •