Base | Representation |
---|---|
bin | 1100001111000011100… |
… | …1011100100000001000 |
3 | 202002120012102102211222 |
4 | 3003300321130200020 |
5 | 11420442201133000 |
6 | 240321535541212 |
7 | 21120644461364 |
oct | 3036071344010 |
9 | 662505372758 |
10 | 210200021000 |
11 | 81166482a22 |
12 | 348a368a808 |
13 | 16a8b5a0368 |
14 | a260a302a4 |
15 | 5703b92a85 |
hex | 30f0e5c808 |
210200021000 has 128 divisors (see below), whose sum is σ = 518352307200. Its totient is φ = 79562995200.
The previous prime is 210200020999. The next prime is 210200021011. The reversal of 210200021000 is 120002012.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17797097 + ... + 17808903.
It is an arithmetic number, because the mean of its divisors is an integer number (4049627400).
Almost surely, 2210200021000 is an apocalyptic number.
210200021000 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 210200021000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (259176153600).
210200021000 is an abundant number, since it is smaller than the sum of its proper divisors (308152286200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210200021000 is a wasteful number, since it uses less digits than its factorization.
210200021000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12784 (or 12770 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 210200021000 its reverse (120002012), we get a palindrome (210320023012).
The spelling of 210200021000 in words is "two hundred ten billion, two hundred million, twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •