Base | Representation |
---|---|
bin | 11110100101110100111… |
… | …000100101111011010100 |
3 | 21102222010221011210011010 |
4 | 132211310320211323110 |
5 | 233420301200001322 |
6 | 4245423133412220 |
7 | 304610322113244 |
oct | 36456470457324 |
9 | 7388127153133 |
10 | 2102200000212 |
11 | 7405a1106684 |
12 | 29b50663a070 |
13 | 12330caa5590 |
14 | 73a65b8bb24 |
15 | 39a3a43420c |
hex | 1e974e25ed4 |
2102200000212 has 48 divisors (see below), whose sum is σ = 5285542913280. Its totient is φ = 646452202368.
The previous prime is 2102200000211. The next prime is 2102200000237. The reversal of 2102200000212 is 2120000022012.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2102200000211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3675948 + ... + 4209155.
It is an arithmetic number, because the mean of its divisors is an integer number (110115477360).
Almost surely, 22102200000212 is an apocalyptic number.
It is an amenable number.
2102200000212 is an abundant number, since it is smaller than the sum of its proper divisors (3183342913068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2102200000212 is a wasteful number, since it uses less digits than its factorization.
2102200000212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7886832 (or 7886830 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 2102200000212 its reverse (2120000022012), we get a palindrome (4222200022224).
The spelling of 2102200000212 in words is "two trillion, one hundred two billion, two hundred million, two hundred twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •