Base | Representation |
---|---|
bin | 1001011000101100… |
… | …10101100001111101 |
3 | 111000011210202011012 |
4 | 10230112111201331 |
5 | 40304442121112 |
6 | 2152003405005 |
7 | 235604651603 |
oct | 45426254175 |
9 | 14004722135 |
10 | 5039020157 |
11 | 2156439476 |
12 | b87683765 |
13 | 623c71442 |
14 | 35b33b873 |
15 | 1e75b3022 |
hex | 12c59587d |
5039020157 has 2 divisors, whose sum is σ = 5039020158. Its totient is φ = 5039020156.
The previous prime is 5039020141. The next prime is 5039020177. The reversal of 5039020157 is 7510209305.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4447022596 + 591997561 = 66686^2 + 24331^2 .
It is a cyclic number.
It is not a de Polignac number, because 5039020157 - 24 = 5039020141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5039020177) 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, 2519510078 + 2519510079.
It is an arithmetic number, because the mean of its divisors is an integer number (2519510079).
Almost surely, 25039020157 is an apocalyptic number.
It is an amenable number.
5039020157 is a deficient number, since it is larger than the sum of its proper divisors (1).
5039020157 is an equidigital number, since it uses as much as digits as its factorization.
5039020157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9450, while the sum is 32.
The square root of 5039020157 is about 70986.0560744151. The cubic root of 5039020157 is about 1714.4126605234.
The spelling of 5039020157 in words is "five billion, thirty-nine million, twenty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •