Base | Representation |
---|---|
bin | 100011011001111100111001… |
… | …0100101110000011100111001 |
3 | 1111211200102021020121010020002 |
4 | 1012303321302211300130321 |
5 | 311304432120242231434 |
6 | 3022204544544242345 |
7 | 122412034515203516 |
oct | 10663716245603471 |
9 | 1454612236533202 |
10 | 311430001133369 |
11 | 9025a7a3749328 |
12 | 2ab192793103b5 |
13 | 104a0952838111 |
14 | 56c94147d230d |
15 | 26010206b157e |
hex | 11b3e72970739 |
311430001133369 has 2 divisors, whose sum is σ = 311430001133370. Its totient is φ = 311430001133368.
The previous prime is 311430001133287. The next prime is 311430001133429. The reversal of 311430001133369 is 963331100034113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 309673414051600 + 1756587081769 = 17597540^2 + 1325363^2 .
It is a cyclic number.
It is not a de Polignac number, because 311430001133369 - 28 = 311430001133113 is a prime.
It is a super-2 number, since 2×3114300011333692 (a number of 30 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (311430031133369) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155715000566684 + 155715000566685.
It is an arithmetic number, because the mean of its divisors is an integer number (155715000566685).
Almost surely, 2311430001133369 is an apocalyptic number.
It is an amenable number.
311430001133369 is a deficient number, since it is larger than the sum of its proper divisors (1).
311430001133369 is an equidigital number, since it uses as much as digits as its factorization.
311430001133369 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 52488, while the sum is 38.
The spelling of 311430001133369 in words is "three hundred eleven trillion, four hundred thirty billion, one million, one hundred thirty-three thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •