Base | Representation |
---|---|
bin | 100110011010010100001… |
… | …0000110111011001101001 |
3 | 200200200111211221201011022 |
4 | 1030310220100313121221 |
5 | 1142443240210113044 |
6 | 15121120533542225 |
7 | 1053260154203654 |
oct | 114645020673151 |
9 | 20620454851138 |
10 | 5279190316649 |
11 | 175598a33a747 |
12 | 7131861a4975 |
13 | 2c3a96854972 |
14 | 14372ac7689b |
15 | 924cd0283ee |
hex | 4cd28437669 |
5279190316649 has 2 divisors, whose sum is σ = 5279190316650. Its totient is φ = 5279190316648.
The previous prime is 5279190316639. The next prime is 5279190316661. The reversal of 5279190316649 is 9466130919725.
5279190316649 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3835455898624 + 1443734418025 = 1958432^2 + 1201555^2 .
It is a cyclic number.
It is not a de Polignac number, because 5279190316649 - 212 = 5279190312553 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5279190316591 and 5279190316600.
It is not a weakly prime, because it can be changed into another prime (5279190316639) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2639595158324 + 2639595158325.
It is an arithmetic number, because the mean of its divisors is an integer number (2639595158325).
Almost surely, 25279190316649 is an apocalyptic number.
It is an amenable number.
5279190316649 is a deficient number, since it is larger than the sum of its proper divisors (1).
5279190316649 is an equidigital number, since it uses as much as digits as its factorization.
5279190316649 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 22044960, while the sum is 62.
The spelling of 5279190316649 in words is "five trillion, two hundred seventy-nine billion, one hundred ninety million, three hundred sixteen thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •