Base | Representation |
---|---|
bin | 1001000101001101000… |
… | …11111111101110011111 |
3 | 1002211102001102222221222 |
4 | 10202212203333232133 |
5 | 20103020204133411 |
6 | 355202350443555 |
7 | 31354306040006 |
oct | 4424643775637 |
9 | 1084361388858 |
10 | 312032099231 |
11 | 110371a92566 |
12 | 50582b035bb |
13 | 23569821a58 |
14 | 11161117c3d |
15 | 81b3b704db |
hex | 48a68ffb9f |
312032099231 has 2 divisors, whose sum is σ = 312032099232. Its totient is φ = 312032099230.
The previous prime is 312032099213. The next prime is 312032099251. The reversal of 312032099231 is 132990230213.
It is a happy number.
Together with previous prime (312032099213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is an emirp because it is prime and its reverse (132990230213) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 312032099231 - 226 = 311964990367 is a prime.
It is a super-2 number, since 2×3120320992312 (a number of 24 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 312032099191 and 312032099200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (312032099251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156016049615 + 156016049616.
It is an arithmetic number, because the mean of its divisors is an integer number (156016049616).
Almost surely, 2312032099231 is an apocalyptic number.
312032099231 is a deficient number, since it is larger than the sum of its proper divisors (1).
312032099231 is an equidigital number, since it uses as much as digits as its factorization.
312032099231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17496, while the sum is 35.
The spelling of 312032099231 in words is "three hundred twelve billion, thirty-two million, ninety-nine thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •