Base | Representation |
---|---|
bin | 100011100001001011111101… |
… | …1001110101011010111111111 |
3 | 1111222012111001202211211010001 |
4 | 1013002113323032223113333 |
5 | 311422230213314212411 |
6 | 3024245445135455131 |
7 | 122543630435520664 |
oct | 10702277316532777 |
9 | 1458174052754101 |
10 | 312424431007231 |
11 | 90603503462a94 |
12 | 2b059b459874a7 |
13 | 10543660b08c1a |
14 | 57215cd169a6b |
15 | 261bd22e04dc1 |
hex | 11c25fb3ab5ff |
312424431007231 has 2 divisors, whose sum is σ = 312424431007232. Its totient is φ = 312424431007230.
The previous prime is 312424431007163. The next prime is 312424431007291. The reversal of 312424431007231 is 132700134424213.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 312424431007231 - 213 = 312424430999039 is a prime.
It is a super-3 number, since 3×3124244310072313 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (312424431007291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156212215503615 + 156212215503616.
It is an arithmetic number, because the mean of its divisors is an integer number (156212215503616).
Almost surely, 2312424431007231 is an apocalyptic number.
312424431007231 is a deficient number, since it is larger than the sum of its proper divisors (1).
312424431007231 is an equidigital number, since it uses as much as digits as its factorization.
312424431007231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96768, while the sum is 37.
The spelling of 312424431007231 in words is "three hundred twelve trillion, four hundred twenty-four billion, four hundred thirty-one million, seven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •