Base | Representation |
---|---|
bin | 1000100111100100… |
… | …0010100010111111 |
3 | 12222020010111001012 |
4 | 2021321002202333 |
5 | 14214214244411 |
6 | 1021320505435 |
7 | 111220561316 |
oct | 21171024277 |
9 | 5866114035 |
10 | 2313431231 |
11 | a87965141 |
12 | 54691b27b |
13 | 2ab398727 |
14 | 17d36727d |
15 | d817618b |
hex | 89e428bf |
2313431231 has 2 divisors, whose sum is σ = 2313431232. Its totient is φ = 2313431230.
The previous prime is 2313431189. The next prime is 2313431251. The reversal of 2313431231 is 1321343132.
2313431231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2313431231 - 26 = 2313431167 is a prime.
It is a super-2 number, since 2×23134312312 = 10703928121132350722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2313431197 and 2313431206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2313431251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1156715615 + 1156715616.
It is an arithmetic number, because the mean of its divisors is an integer number (1156715616).
Almost surely, 22313431231 is an apocalyptic number.
2313431231 is a deficient number, since it is larger than the sum of its proper divisors (1).
2313431231 is an equidigital number, since it uses as much as digits as its factorization.
2313431231 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1296, while the sum is 23.
The square root of 2313431231 is about 48098.1416584882. The cubic root of 2313431231 is about 1322.5706011578.
Adding to 2313431231 its reverse (1321343132), we get a palindrome (3634774363).
The spelling of 2313431231 in words is "two billion, three hundred thirteen million, four hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •