Base | Representation |
---|---|
bin | 1001010111110110… |
… | …11110000001100001 |
3 | 110222200112220211122 |
4 | 10223323132001201 |
5 | 40301141231212 |
6 | 2151152422025 |
7 | 235461046022 |
oct | 45373360141 |
9 | 13880486748 |
10 | 5031977057 |
11 | 2152468928 |
12 | b85247915 |
13 | 622676723 |
14 | 35a426c49 |
15 | 1e6b71272 |
hex | 12bede061 |
5031977057 has 2 divisors, whose sum is σ = 5031977058. Its totient is φ = 5031977056.
The previous prime is 5031977011. The next prime is 5031977087. The reversal of 5031977057 is 7507791305.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3526459456 + 1505517601 = 59384^2 + 38801^2 .
It is a cyclic number.
It is not a de Polignac number, because 5031977057 - 218 = 5031714913 is a prime.
It is a super-5 number, since 5×50319770575 (a number of 50 digits) contains 55555 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5031976999 and 5031977017.
It is not a weakly prime, because it can be changed into another prime (5031977087) 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, 2515988528 + 2515988529.
It is an arithmetic number, because the mean of its divisors is an integer number (2515988529).
Almost surely, 25031977057 is an apocalyptic number.
It is an amenable number.
5031977057 is a deficient number, since it is larger than the sum of its proper divisors (1).
5031977057 is an equidigital number, since it uses as much as digits as its factorization.
5031977057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 231525, while the sum is 44.
The square root of 5031977057 is about 70936.4296888418. The cubic root of 5031977057 is about 1713.6135362562.
The spelling of 5031977057 in words is "five billion, thirty-one million, nine hundred seventy-seven thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •