Base | Representation |
---|---|
bin | 101111100110001010… |
… | …0101001100111010000 |
3 | 100202211100022102020221 |
4 | 1133030110221213100 |
5 | 3133312311310300 |
6 | 114542230242424 |
7 | 10245625322446 |
oct | 1371424514720 |
9 | 322740272227 |
10 | 102212213200 |
11 | 3a391147679 |
12 | 179867b6414 |
13 | 983bc29136 |
14 | 4d38b9ab96 |
15 | 29d356a31a |
hex | 17cc5299d0 |
102212213200 has 60 divisors (see below), whose sum is σ = 245596338988. Its totient is φ = 40879641600.
The previous prime is 102212213197. The next prime is 102212213219. The reversal of 102212213200 is 2312212201.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 83393424 + 102128819776 = 9132^2 + 319576^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5102404 + ... + 5122396.
Almost surely, 2102212213200 is an apocalyptic number.
102212213200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102212213200 is an abundant number, since it is smaller than the sum of its proper divisors (143384125788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102212213200 is a wasteful number, since it uses less digits than its factorization.
102212213200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32792 (or 32781 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 102212213200 its reverse (2312212201), we get a palindrome (104524425401).
Subtracting from 102212213200 its reverse (2312212201), we obtain a palindrome (99900000999).
The spelling of 102212213200 in words is "one hundred two billion, two hundred twelve million, two hundred thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •