Base | Representation |
---|---|
bin | 1001010101110110… |
… | …10011000111000101 |
3 | 110221111220021111201 |
4 | 10222323103013011 |
5 | 40232334431031 |
6 | 2145352102501 |
7 | 235165054363 |
oct | 45273230705 |
9 | 13844807451 |
10 | 5015155141 |
11 | 2143a19317 |
12 | b7b694a31 |
13 | 61c036a29 |
14 | 3580c8633 |
15 | 1e544bd61 |
hex | 12aed31c5 |
5015155141 has 2 divisors, whose sum is σ = 5015155142. Its totient is φ = 5015155140.
The previous prime is 5015155099. The next prime is 5015155147. The reversal of 5015155141 is 1415515105.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4366434241 + 648720900 = 66079^2 + 25470^2 .
It is a cyclic number.
It is not a de Polignac number, because 5015155141 - 229 = 4478284229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5015155147) 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, 2507577570 + 2507577571.
It is an arithmetic number, because the mean of its divisors is an integer number (2507577571).
Almost surely, 25015155141 is an apocalyptic number.
It is an amenable number.
5015155141 is a deficient number, since it is larger than the sum of its proper divisors (1).
5015155141 is an equidigital number, since it uses as much as digits as its factorization.
5015155141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2500, while the sum is 28.
The square root of 5015155141 is about 70817.7600676553. The cubic root of 5015155141 is about 1711.7018658515.
The spelling of 5015155141 in words is "five billion, fifteen million, one hundred fifty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •