Base | Representation |
---|---|
bin | 100011011001111100110111… |
… | …0100101110000011101101101 |
3 | 1111211200102002120022122020112 |
4 | 1012303321232211300131231 |
5 | 311304432001102241212 |
6 | 3022204534150025405 |
7 | 122412033041611145 |
oct | 10663715645603555 |
9 | 1454612076278215 |
10 | 311429934024557 |
11 | 9025a7698824a7 |
12 | 2ab1925a948265 |
13 | 104a094196c56a |
14 | 56c9409923925 |
15 | 2601019857422 |
hex | 11b3e6e97076d |
311429934024557 has 2 divisors, whose sum is σ = 311429934024558. Its totient is φ = 311429934024556.
The previous prime is 311429934024541. The next prime is 311429934024569. The reversal of 311429934024557 is 755420439924113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 201287029004356 + 110142905020201 = 14187566^2 + 10494899^2 .
It is a cyclic number.
It is not a de Polignac number, because 311429934024557 - 24 = 311429934024541 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 311429934024496 and 311429934024505.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (311429934024257) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155714967012278 + 155714967012279.
It is an arithmetic number, because the mean of its divisors is an integer number (155714967012279).
Almost surely, 2311429934024557 is an apocalyptic number.
It is an amenable number.
311429934024557 is a deficient number, since it is larger than the sum of its proper divisors (1).
311429934024557 is an equidigital number, since it uses as much as digits as its factorization.
311429934024557 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32659200, while the sum is 59.
The spelling of 311429934024557 in words is "three hundred eleven trillion, four hundred twenty-nine billion, nine hundred thirty-four million, twenty-four thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •