Base | Representation |
---|---|
bin | 1100001011110… |
… | …10010011000000 |
3 | 21010022221121021 |
4 | 12011322103000 |
5 | 202131302200 |
6 | 14050435224 |
7 | 2350536334 |
oct | 605722300 |
9 | 233287537 |
10 | 102212800 |
11 | 52772a98 |
12 | 2a292b14 |
13 | 18239a61 |
14 | d8097c4 |
15 | 8e9041a |
hex | 617a4c0 |
102212800 has 84 divisors (see below), whose sum is σ = 253574296. Its totient is φ = 40550400.
The previous prime is 102212777. The next prime is 102212801. The reversal of 102212800 is 8212201.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is not an unprimeable number, because it can be changed into a prime (102212801) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 308635 + ... + 308965.
Almost surely, 2102212800 is an apocalyptic number.
102212800 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 102212800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126787148).
102212800 is an abundant number, since it is smaller than the sum of its proper divisors (151361496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102212800 is a wasteful number, since it uses less digits than its factorization.
102212800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 546 (or 531 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
The square root of 102212800 is about 10110.0346191296. The cubic root of 102212800 is about 467.5575724802.
The spelling of 102212800 in words is "one hundred two million, two hundred twelve thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •