Base | Representation |
---|---|
bin | 10011000001011000… |
… | …00100110001010000 |
3 | 222100200212111021101 |
4 | 21200230010301100 |
5 | 131403244214300 |
6 | 4405200434144 |
7 | 511031266540 |
oct | 114054046120 |
9 | 28320774241 |
10 | 10212101200 |
11 | 4370512864 |
12 | 1b90018954 |
13 | c69920842 |
14 | 6cc3b5320 |
15 | 3eb807b6a |
hex | 260b04c50 |
10212101200 has 120 divisors (see below), whose sum is σ = 29258805888. Its totient is φ = 3349040640.
The previous prime is 10212101191. The next prime is 10212101257. The reversal of 10212101200 is 210121201.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 14887 + ... + 143686.
Almost surely, 210212101200 is an apocalyptic number.
10212101200 is a gapful number since it is divisible by the number (10) 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 10212101200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14629402944).
10212101200 is an abundant number, since it is smaller than the sum of its proper divisors (19046704688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10212101200 is a wasteful number, since it uses less digits than its factorization.
10212101200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158621 (or 158610 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10212101200 its reverse (210121201), we get a palindrome (10422222401).
The spelling of 10212101200 in words is "ten billion, two hundred twelve million, one hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •