Base | Representation |
---|---|
bin | 111110111100110… |
… | …0001001011110011 |
3 | 12110012112102000121 |
4 | 1331321201023303 |
5 | 13311212331011 |
6 | 545332231111 |
7 | 103225442224 |
oct | 17571411363 |
9 | 5405472017 |
10 | 2112230131 |
11 | 994331840 |
12 | 4ab46b497 |
13 | 2787b081b |
14 | 16075124b |
15 | c5680e71 |
hex | 7de612f3 |
2112230131 has 4 divisors (see below), whose sum is σ = 2304251064. Its totient is φ = 1920209200.
The previous prime is 2112230117. The next prime is 2112230177. The reversal of 2112230131 is 1310322112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2112230131 - 213 = 2112221939 is a prime.
It is a super-2 number, since 2×21122301312 = 8923032252608554322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2112230111) 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 3 ways as a sum of consecutive naturals, for example, 96010450 + ... + 96010471.
It is an arithmetic number, because the mean of its divisors is an integer number (576062766).
Almost surely, 22112230131 is an apocalyptic number.
2112230131 is a deficient number, since it is larger than the sum of its proper divisors (192020933).
2112230131 is a wasteful number, since it uses less digits than its factorization.
2112230131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192020932.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 2112230131 is about 45959.0048956676. The cubic root of 2112230131 is about 1283.0603308793.
Adding to 2112230131 its reverse (1310322112), we get a palindrome (3422552243).
The spelling of 2112230131 in words is "two billion, one hundred twelve million, two hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •