Base | Representation |
---|---|
bin | 100101110100111111111… |
… | …1010010000000111011101 |
3 | 200102000200011212012212001 |
4 | 1023221333322100013131 |
5 | 1140140131414424312 |
6 | 15020225154042301 |
7 | 1044422315200162 |
oct | 113517772200735 |
9 | 20360604765761 |
10 | 5199056404957 |
11 | 17249a888a848 |
12 | 6bb741579391 |
13 | 2b9365a64a7c |
14 | 13d8c8400069 |
15 | 9038ce07057 |
hex | 4ba7fe901dd |
5199056404957 has 2 divisors, whose sum is σ = 5199056404958. Its totient is φ = 5199056404956.
The previous prime is 5199056404909. The next prime is 5199056404987. The reversal of 5199056404957 is 7594046509915.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5127751918116 + 71304486841 = 2264454^2 + 267029^2 .
It is a cyclic number.
It is not a de Polignac number, because 5199056404957 - 239 = 4649300591069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5199056404987) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2599528202478 + 2599528202479.
It is an arithmetic number, because the mean of its divisors is an integer number (2599528202479).
Almost surely, 25199056404957 is an apocalyptic number.
It is an amenable number.
5199056404957 is a deficient number, since it is larger than the sum of its proper divisors (1).
5199056404957 is an equidigital number, since it uses as much as digits as its factorization.
5199056404957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 61236000, while the sum is 64.
The spelling of 5199056404957 in words is "five trillion, one hundred ninety-nine billion, fifty-six million, four hundred four thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •