Base | Representation |
---|---|
bin | 1001000011101100010… |
… | …10000101010100010111 |
3 | 1002202022110100002021112 |
4 | 10201312022011110113 |
5 | 20044334310000043 |
6 | 354550020405235 |
7 | 31325215231562 |
oct | 4416612052427 |
9 | 1082273302245 |
10 | 311220000023 |
11 | 10aa95638399 |
12 | 50396b4681b |
13 | 2346a4c398a |
14 | 110c531d4d9 |
15 | 8167708518 |
hex | 4876285517 |
311220000023 has 2 divisors, whose sum is σ = 311220000024. Its totient is φ = 311220000022.
The previous prime is 311219999989. The next prime is 311220000041. The reversal of 311220000023 is 320000022113.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 311220000023 - 232 = 306925032727 is a prime.
It is a super-2 number, since 2×3112200000232 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 311219999962 and 311220000007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (311220000523) 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, 155610000011 + 155610000012.
It is an arithmetic number, because the mean of its divisors is an integer number (155610000012).
Almost surely, 2311220000023 is an apocalyptic number.
311220000023 is a deficient number, since it is larger than the sum of its proper divisors (1).
311220000023 is an equidigital number, since it uses as much as digits as its factorization.
311220000023 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 14.
Adding to 311220000023 its reverse (320000022113), we get a palindrome (631220022136).
The spelling of 311220000023 in words is "three hundred eleven billion, two hundred twenty million, twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •