Base | Representation |
---|---|
bin | 111110111100100… |
… | …0011111000110011 |
3 | 12110012022022102011 |
4 | 1331321003320303 |
5 | 13311200011011 |
6 | 545325503351 |
7 | 103224432325 |
oct | 17571037063 |
9 | 5405268364 |
10 | 2112110131 |
11 | 99425a66a |
12 | 4ab411b57 |
13 | 27876b011 |
14 | 16071d615 |
15 | c565a621 |
hex | 7de43e33 |
2112110131 has 8 divisors (see below), whose sum is σ = 2127454560. Its totient is φ = 2096821632.
The previous prime is 2112110123. The next prime is 2112110137. The reversal of 2112110131 is 1310112112.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2112110131 - 23 = 2112110123 is a prime.
It is a super-2 number, since 2×21121101312 = 8922018410945674322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2112110137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 63355 + ... + 90763.
It is an arithmetic number, because the mean of its divisors is an integer number (265931820).
Almost surely, 22112110131 is an apocalyptic number.
2112110131 is a deficient number, since it is larger than the sum of its proper divisors (15344429).
2112110131 is a wasteful number, since it uses less digits than its factorization.
2112110131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27965.
The product of its (nonzero) digits is 12, while the sum is 13.
The square root of 2112110131 is about 45957.6993658299. The cubic root of 2112110131 is about 1283.0360326816.
Adding to 2112110131 its reverse (1310112112), we get a palindrome (3422222243).
The spelling of 2112110131 in words is "two billion, one hundred twelve million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •