Base | Representation |
---|---|
bin | 111110111100100… |
… | …1001000010011101 |
3 | 12110012100101100120 |
4 | 1331321021002131 |
5 | 13311201144404 |
6 | 545330145153 |
7 | 103224550665 |
oct | 17571110235 |
9 | 5405311316 |
10 | 2112131229 |
11 | 9942744aa |
12 | 4ab4221b9 |
13 | 2787777c0 |
14 | 1607271a5 |
15 | c56619d9 |
hex | 7de4909d |
2112131229 has 8 divisors (see below), whose sum is σ = 3032803872. Its totient is φ = 1299773040.
The previous prime is 2112131207. The next prime is 2112131243. The reversal of 2112131229 is 9221312112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2112131229 - 220 = 2111082653 is a prime.
It is a super-2 number, since 2×21121312292 = 8922196657034100882, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2112131199 and 2112131208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2112131299) 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 7 ways as a sum of consecutive naturals, for example, 27078567 + ... + 27078644.
It is an arithmetic number, because the mean of its divisors is an integer number (379100484).
Almost surely, 22112131229 is an apocalyptic number.
It is an amenable number.
2112131229 is a deficient number, since it is larger than the sum of its proper divisors (920672643).
2112131229 is a wasteful number, since it uses less digits than its factorization.
2112131229 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54157227.
The product of its digits is 432, while the sum is 24.
The square root of 2112131229 is about 45957.9289024212. The cubic root of 2112131229 is about 1283.0403047764.
The spelling of 2112131229 in words is "two billion, one hundred twelve million, one hundred thirty-one thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •