Base | Representation |
---|---|
bin | 11110101111001001101… |
… | …001101110001110101101 |
3 | 21110220222200201011002021 |
4 | 132233021221232032231 |
5 | 234101302244200023 |
6 | 4254200431430141 |
7 | 305413404421501 |
oct | 36571151561655 |
9 | 7426880634067 |
10 | 2112212100013 |
11 | 744869735424 |
12 | 2a143b685351 |
13 | 12424713b2a2 |
14 | 74335780301 |
15 | 39e243d235d |
hex | 1ebc9a6e3ad |
2112212100013 has 32 divisors (see below), whose sum is σ = 2350068069888. Its totient is φ = 1889843097600.
The previous prime is 2112212099999. The next prime is 2112212100109. The reversal of 2112212100013 is 3100012122112.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2112212100013 is a prime.
It is a super-2 number, since 2×21122121000132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2112212100013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2112212106013) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7294273 + ... + 7578313.
It is an arithmetic number, because the mean of its divisors is an integer number (73439627184).
Almost surely, 22112212100013 is an apocalyptic number.
It is an amenable number.
2112212100013 is a deficient number, since it is larger than the sum of its proper divisors (237855969875).
2112212100013 is a wasteful number, since it uses less digits than its factorization.
2112212100013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284373.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 2112212100013 its reverse (3100012122112), we get a palindrome (5212224222125).
The spelling of 2112212100013 in words is "two trillion, one hundred twelve billion, two hundred twelve million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •