Base | Representation |
---|---|
bin | 111110111100100… |
… | …0001101010010101 |
3 | 12110012021211220110 |
4 | 1331321001222111 |
5 | 13311144213023 |
6 | 545325353233 |
7 | 103224363621 |
oct | 17571015225 |
9 | 5405254813 |
10 | 2112101013 |
11 | 994253830 |
12 | 4ab408819 |
13 | 278766b19 |
14 | 16071a181 |
15 | c5657a93 |
hex | 7de41a95 |
2112101013 has 16 divisors (see below), whose sum is σ = 3089318400. Its totient is φ = 1272906480.
The previous prime is 2112101011. The next prime is 2112101023. The reversal of 2112101013 is 3101012112.
It is not a de Polignac number, because 2112101013 - 21 = 2112101011 is a prime.
It is a super-3 number, since 3×21121010133 (a number of 29 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2112101013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2112101011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 172873 + ... + 184686.
It is an arithmetic number, because the mean of its divisors is an integer number (193082400).
Almost surely, 22112101013 is an apocalyptic number.
It is an amenable number.
2112101013 is a deficient number, since it is larger than the sum of its proper divisors (977217387).
2112101013 is a wasteful number, since it uses less digits than its factorization.
2112101013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 357752.
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 2112101013 is about 45957.6001658050. The cubic root of 2112101013 is about 1283.0341863860.
Adding to 2112101013 its reverse (3101012112), we get a palindrome (5213113125).
The spelling of 2112101013 in words is "two billion, one hundred twelve million, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •