Base | Representation |
---|---|
bin | 1011100011000011100… |
… | …01110000110100100001 |
3 | 1101221011002201122210222 |
4 | 11301201301300310201 |
5 | 23000100010114314 |
6 | 502135501132425 |
7 | 40444341322103 |
oct | 5614161606441 |
9 | 1357132648728 |
10 | 396777426209 |
11 | 1432aa570a7a |
12 | 64a93b5a115 |
13 | 2b553ac7a48 |
14 | 152c01bd573 |
15 | a4c3a3bc8e |
hex | 5c61c70d21 |
396777426209 has 2 divisors, whose sum is σ = 396777426210. Its totient is φ = 396777426208.
The previous prime is 396777426137. The next prime is 396777426211. The reversal of 396777426209 is 902624777693.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 213531789025 + 183245637184 = 462095^2 + 428072^2 .
It is a cyclic number.
It is not a de Polignac number, because 396777426209 - 212 = 396777422113 is a prime.
It is a super-2 number, since 2×3967774262092 (a number of 24 digits) contains 22 as substring.
Together with 396777426211, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (396777426239) 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, 198388713104 + 198388713105.
It is an arithmetic number, because the mean of its divisors is an integer number (198388713105).
Almost surely, 2396777426209 is an apocalyptic number.
It is an amenable number.
396777426209 is a deficient number, since it is larger than the sum of its proper divisors (1).
396777426209 is an equidigital number, since it uses as much as digits as its factorization.
396777426209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48009024, while the sum is 62.
The spelling of 396777426209 in words is "three hundred ninety-six billion, seven hundred seventy-seven million, four hundred twenty-six thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •