Base | Representation |
---|---|
bin | 1001100100011100… |
… | …10110001101101101 |
3 | 111021001021120022211 |
4 | 10302032112031231 |
5 | 41010210322401 |
6 | 2205444210421 |
7 | 241212533611 |
oct | 46216261555 |
9 | 14231246284 |
10 | 5137589101 |
11 | 21a7042807 |
12 | bb4699a11 |
13 | 63b503768 |
14 | 36a479341 |
15 | 201083951 |
hex | 13239636d |
5137589101 has 2 divisors, whose sum is σ = 5137589102. Its totient is φ = 5137589100.
The previous prime is 5137589071. The next prime is 5137589141. The reversal of 5137589101 is 1019857315.
It is an a-pointer prime, because the next prime (5137589141) can be obtained adding 5137589101 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4723263076 + 414326025 = 68726^2 + 20355^2 .
It is a cyclic number.
It is not a de Polignac number, because 5137589101 - 211 = 5137587053 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5137589141) 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, 2568794550 + 2568794551.
It is an arithmetic number, because the mean of its divisors is an integer number (2568794551).
Almost surely, 25137589101 is an apocalyptic number.
It is an amenable number.
5137589101 is a deficient number, since it is larger than the sum of its proper divisors (1).
5137589101 is an equidigital number, since it uses as much as digits as its factorization.
5137589101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 37800, while the sum is 40.
The square root of 5137589101 is about 71676.9774823130. The cubic root of 5137589101 is about 1725.5191717140.
The spelling of 5137589101 in words is "five billion, one hundred thirty-seven million, five hundred eighty-nine thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •