Base | Representation |
---|---|
bin | 1001100101010100… |
… | …10101101010011101 |
3 | 111021120002100212022 |
4 | 10302222111222131 |
5 | 41014100130002 |
6 | 2210305345525 |
7 | 241332104546 |
oct | 46252255235 |
9 | 14246070768 |
10 | 5144926877 |
11 | 22001a4792 |
12 | bb70382a5 |
13 | 63cba263c |
14 | 36b4294cd |
15 | 201a32ba2 |
hex | 132a95a9d |
5144926877 has 2 divisors, whose sum is σ = 5144926878. Its totient is φ = 5144926876.
The previous prime is 5144926867. The next prime is 5144926901. The reversal of 5144926877 is 7786294415.
5144926877 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., 4968276196 + 176650681 = 70486^2 + 13291^2 .
It is a cyclic number.
It is not a de Polignac number, because 5144926877 - 210 = 5144925853 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5144926807) 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, 2572463438 + 2572463439.
It is an arithmetic number, because the mean of its divisors is an integer number (2572463439).
Almost surely, 25144926877 is an apocalyptic number.
It is an amenable number.
5144926877 is a deficient number, since it is larger than the sum of its proper divisors (1).
5144926877 is an equidigital number, since it uses as much as digits as its factorization.
5144926877 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3386880, while the sum is 53.
The square root of 5144926877 is about 71728.1456403273. The cubic root of 5144926877 is about 1726.3402734517.
The spelling of 5144926877 in words is "five billion, one hundred forty-four million, nine hundred twenty-six thousand, eight hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •