Base | Representation |
---|---|
bin | 1001000001101010011… |
… | …00111100001111010111 |
3 | 1002122111111202001011101 |
4 | 10200311030330033113 |
5 | 20040121314331411 |
6 | 354245531050531 |
7 | 31256213314303 |
oct | 4406514741727 |
9 | 1078444661141 |
10 | 310130230231 |
11 | 10a5864801a8 |
12 | 50131ba0a47 |
13 | 233257b5593 |
14 | 110206c4d03 |
15 | 8101be38c1 |
hex | 483533c3d7 |
310130230231 has 2 divisors, whose sum is σ = 310130230232. Its totient is φ = 310130230230.
The previous prime is 310130230213. The next prime is 310130230247. The reversal of 310130230231 is 132032031013.
Together with previous prime (310130230213) 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-310130230231 is a prime.
It is a super-2 number, since 2×3101302302312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 310130230199 and 310130230208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (310130230261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155065115115 + 155065115116.
It is an arithmetic number, because the mean of its divisors is an integer number (155065115116).
Almost surely, 2310130230231 is an apocalyptic number.
310130230231 is a deficient number, since it is larger than the sum of its proper divisors (1).
310130230231 is an equidigital number, since it uses as much as digits as its factorization.
310130230231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 310130230231 its reverse (132032031013), we get a palindrome (442162261244).
The spelling of 310130230231 in words is "three hundred ten billion, one hundred thirty million, two hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •