Base | Representation |
---|---|
bin | 111110111100100… |
… | …0001011101110100 |
3 | 12110012021210210210 |
4 | 1331321001131310 |
5 | 13311144201322 |
6 | 545325345420 |
7 | 103224361365 |
oct | 17571013564 |
9 | 5405253723 |
10 | 2112100212 |
11 | 994253172 |
12 | 4ab408270 |
13 | 278766651 |
14 | 160719b6c |
15 | c565770c |
hex | 7de41774 |
2112100212 has 72 divisors (see below), whose sum is σ = 5173142464. Its totient is φ = 670640256.
The previous prime is 2112100201. The next prime is 2112100223. The reversal of 2112100212 is 2120012112.
It is an interprime number because it is at equal distance from previous prime (2112100201) and next prime (2112100223).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1986393 + ... + 1987455.
Almost surely, 22112100212 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2112100212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2586571232).
2112100212 is an abundant number, since it is smaller than the sum of its proper divisors (3061042252).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2112100212 is a wasteful number, since it uses less digits than its factorization.
2112100212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1429 (or 1404 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
The square root of 2112100212 is about 45957.5914512499. The cubic root of 2112100212 is about 1283.0340241919.
Adding to 2112100212 its reverse (2120012112), we get a palindrome (4232112324).
The spelling of 2112100212 in words is "two billion, one hundred twelve million, one hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •