Base | Representation |
---|---|
bin | 1001000011100000011… |
… | …01001001100010000111 |
3 | 1002202001111102200122211 |
4 | 10201300031021202013 |
5 | 20044133223443143 |
6 | 354532052204251 |
7 | 31322563362661 |
oct | 4416015114207 |
9 | 1082044380584 |
10 | 311120140423 |
11 | 10aa442323a4 |
12 | 50369609687 |
13 | 234528cc061 |
14 | 110b5d67531 |
15 | 815da8049d |
hex | 4870349887 |
311120140423 has 2 divisors, whose sum is σ = 311120140424. Its totient is φ = 311120140422.
The previous prime is 311120140333. The next prime is 311120140433. The reversal of 311120140423 is 324041021113.
It is a strong prime.
It is an emirp because it is prime and its reverse (324041021113) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 311120140423 - 213 = 311120132231 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 311120140394 and 311120140403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (311120140433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155560070211 + 155560070212.
It is an arithmetic number, because the mean of its divisors is an integer number (155560070212).
Almost surely, 2311120140423 is an apocalyptic number.
311120140423 is a deficient number, since it is larger than the sum of its proper divisors (1).
311120140423 is an equidigital number, since it uses as much as digits as its factorization.
311120140423 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 311120140423 its reverse (324041021113), we get a palindrome (635161161536).
The spelling of 311120140423 in words is "three hundred eleven billion, one hundred twenty million, one hundred forty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •