Base | Representation |
---|---|
bin | 111111001011110… |
… | …0101100001100111 |
3 | 12110202100212020020 |
4 | 1332113211201213 |
5 | 13320222042411 |
6 | 550213210223 |
7 | 103352441136 |
oct | 17627454147 |
9 | 5422325206 |
10 | 2120112231 |
11 | 998825776 |
12 | 4b2030973 |
13 | 27a3103a3 |
14 | 16180391d |
15 | c61db606 |
hex | 7e5e5867 |
2120112231 has 16 divisors (see below), whose sum is σ = 2861046144. Its totient is φ = 1396365984.
The previous prime is 2120112217. The next prime is 2120112233. The reversal of 2120112231 is 1322110212.
It is not a de Polignac number, because 2120112231 - 25 = 2120112199 is a prime.
It is a super-2 number, since 2×21201122312 = 8989751744071594722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2120112231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2120112233) 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 15 ways as a sum of consecutive naturals, for example, 110880 + ... + 128586.
It is an arithmetic number, because the mean of its divisors is an integer number (178815384).
Almost surely, 22120112231 is an apocalyptic number.
2120112231 is a deficient number, since it is larger than the sum of its proper divisors (740933913).
2120112231 is a wasteful number, since it uses less digits than its factorization.
2120112231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18190.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 2120112231 is about 46044.6764675353. The cubic root of 2120112231 is about 1284.6543264155.
Adding to 2120112231 its reverse (1322110212), we get a palindrome (3442222443).
The spelling of 2120112231 in words is "two billion, one hundred twenty million, one hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •