Base | Representation |
---|---|
bin | 1011010010101011… |
… | …0110000001110111 |
3 | 21211020121100222122 |
4 | 2310222312001313 |
5 | 22201432131411 |
6 | 1220435350155 |
7 | 135054116243 |
oct | 26452660167 |
9 | 7736540878 |
10 | 3031130231 |
11 | 1315aa3008 |
12 | 70715235b |
13 | 393c93aac |
14 | 20a7cb423 |
15 | 12b1929db |
hex | b4ab6077 |
3031130231 has 2 divisors, whose sum is σ = 3031130232. Its totient is φ = 3031130230.
The previous prime is 3031130213. The next prime is 3031130239. The reversal of 3031130231 is 1320311303.
Together with previous prime (3031130213) 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 not a de Polignac number, because 3031130231 - 214 = 3031113847 is a prime.
It is a super-2 number, since 2×30311302312 = 18375500954564226722, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3031130239) 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, 1515565115 + 1515565116.
It is an arithmetic number, because the mean of its divisors is an integer number (1515565116).
Almost surely, 23031130231 is an apocalyptic number.
3031130231 is a deficient number, since it is larger than the sum of its proper divisors (1).
3031130231 is an equidigital number, since it uses as much as digits as its factorization.
3031130231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 17.
The square root of 3031130231 is about 55055.7011670908. The cubic root of 3031130231 is about 1447.2210319262.
Adding to 3031130231 its reverse (1320311303), we get a palindrome (4351441534).
The spelling of 3031130231 in words is "three billion, thirty-one million, one hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •