Base | Representation |
---|---|
bin | 1000100111101110… |
… | …1010110010001011 |
3 | 12222021102111022102 |
4 | 2021323222302023 |
5 | 14214403322311 |
6 | 1021343344015 |
7 | 111226461335 |
oct | 21173526213 |
9 | 5867374272 |
10 | 2314120331 |
11 | a88295946 |
12 | 546bb200b |
13 | 2ab57a293 |
14 | 17d4a6455 |
15 | d826043b |
hex | 89eeac8b |
2314120331 has 2 divisors, whose sum is σ = 2314120332. Its totient is φ = 2314120330.
The previous prime is 2314120313. The next prime is 2314120343. The reversal of 2314120331 is 1330214132.
Together with previous prime (2314120313) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2314120331 is a prime.
It is a super-2 number, since 2×23141203312 = 10710305812695099122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2314120301) 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 as a sum of consecutive naturals, namely, 1157060165 + 1157060166.
It is an arithmetic number, because the mean of its divisors is an integer number (1157060166).
Almost surely, 22314120331 is an apocalyptic number.
2314120331 is a deficient number, since it is larger than the sum of its proper divisors (1).
2314120331 is an equidigital number, since it uses as much as digits as its factorization.
2314120331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
The square root of 2314120331 is about 48105.3046035466. The cubic root of 2314120331 is about 1322.7019058209.
Adding to 2314120331 its reverse (1330214132), we get a palindrome (3644334463).
The spelling of 2314120331 in words is "two billion, three hundred fourteen million, one hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.224 sec. • engine limits •