Base | Representation |
---|---|
bin | 1001000101100010011… |
… | …10110111100010000111 |
3 | 1002211212112021200121022 |
4 | 10202301032313202013 |
5 | 20103402021010043 |
6 | 355232223341355 |
7 | 31361611435241 |
oct | 4426116674207 |
9 | 1084775250538 |
10 | 312211110023 |
11 | 110454039a6a |
12 | 50612a5185b |
13 | 2359793a5b7 |
14 | 1117abd5091 |
15 | 81c4730868 |
hex | 48b13b7887 |
312211110023 has 2 divisors, whose sum is σ = 312211110024. Its totient is φ = 312211110022.
The previous prime is 312211110017. The next prime is 312211110073. The reversal of 312211110023 is 320011112213.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 312211110023 - 220 = 312210061447 is a prime.
It is a super-2 number, since 2×3122111100232 (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 = 312211109983 and 312211110010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (312211110073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156105555011 + 156105555012.
It is an arithmetic number, because the mean of its divisors is an integer number (156105555012).
Almost surely, 2312211110023 is an apocalyptic number.
312211110023 is a deficient number, since it is larger than the sum of its proper divisors (1).
312211110023 is an equidigital number, since it uses as much as digits as its factorization.
312211110023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 312211110023 its reverse (320011112213), we get a palindrome (632222222236).
The spelling of 312211110023 in words is "three hundred twelve billion, two hundred eleven million, one hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •