Base | Representation |
---|---|
bin | 111111001100001… |
… | …1110011010001111 |
3 | 12110202210200211212 |
4 | 1332120132122033 |
5 | 13320302021411 |
6 | 550222205035 |
7 | 103354431344 |
oct | 17630363217 |
9 | 5422720755 |
10 | 2120345231 |
11 | 998974834 |
12 | 4b212377b |
13 | 27a392464 |
14 | 1618647cb |
15 | c623568b |
hex | 7e61e68f |
2120345231 has 2 divisors, whose sum is σ = 2120345232. Its totient is φ = 2120345230.
The previous prime is 2120345203. The next prime is 2120345243. The reversal of 2120345231 is 1325430212.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2120345231 is a prime.
It is a super-2 number, since 2×21203452312 = 8991727797248886722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2120345197 and 2120345206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2120345291) 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 as a sum of consecutive naturals, namely, 1060172615 + 1060172616.
It is an arithmetic number, because the mean of its divisors is an integer number (1060172616).
Almost surely, 22120345231 is an apocalyptic number.
2120345231 is a deficient number, since it is larger than the sum of its proper divisors (1).
2120345231 is an equidigital number, since it uses as much as digits as its factorization.
2120345231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 2120345231 is about 46047.2065493663. The cubic root of 2120345231 is about 1284.7013857943.
Adding to 2120345231 its reverse (1325430212), we get a palindrome (3445775443).
The spelling of 2120345231 in words is "two billion, one hundred twenty million, three hundred forty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •