Base | Representation |
---|---|
bin | 1100001110010100001… |
… | …0010010010111101000 |
3 | 202002001022221202002200 |
4 | 3003211002102113220 |
5 | 11420040224342300 |
6 | 240250110300200 |
7 | 21113010102660 |
oct | 3034502222750 |
9 | 662038852080 |
10 | 210001012200 |
11 | 81074107741 |
12 | 34848ab7660 |
13 | 16a592a2285 |
14 | a2424291a0 |
15 | 56e1482200 |
hex | 30e50925e8 |
210001012200 has 288 divisors, whose sum is σ = 832005557760. Its totient is φ = 46451750400.
The previous prime is 210001012171. The next prime is 210001012213. The reversal of 210001012200 is 2210100012.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 121782 + ... + 659418.
Almost surely, 2210001012200 is an apocalyptic number.
210001012200 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 210001012200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (416002778880).
210001012200 is an abundant number, since it is smaller than the sum of its proper divisors (622004545560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210001012200 is a wasteful number, since it uses less digits than its factorization.
210001012200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 537697 (or 537685 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 210001012200 its reverse (2210100012), we get a palindrome (212211112212).
The spelling of 210001012200 in words is "two hundred ten billion, one million, twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •