Base | Representation |
---|---|
bin | 1001010100011001… |
… | …11100110011100101 |
3 | 110220200000222212022 |
4 | 10222030330303211 |
5 | 40221232131112 |
6 | 2144235432525 |
7 | 234656561603 |
oct | 45214746345 |
9 | 13820028768 |
10 | 5003005157 |
11 | 213807a907 |
12 | b775b5745 |
13 | 6196716a7 |
14 | 356644873 |
15 | 1e434bd72 |
hex | 12a33cce5 |
5003005157 has 8 divisors (see below), whose sum is σ = 5301688536. Its totient is φ = 4704809472.
The previous prime is 5003005069. The next prime is 5003005199. The reversal of 5003005157 is 7515003005.
It can be written as a sum of positive squares in 4 ways, for example, as 28665316 + 4974339841 = 5354^2 + 70529^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5003005157 - 28 = 5003004901 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5003035157) 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 in 7 ways as a sum of consecutive naturals, for example, 100688 + ... + 141929.
It is an arithmetic number, because the mean of its divisors is an integer number (662711067).
Almost surely, 25003005157 is an apocalyptic number.
It is an amenable number.
5003005157 is a deficient number, since it is larger than the sum of its proper divisors (298683379).
5003005157 is a wasteful number, since it uses less digits than its factorization.
5003005157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243847.
The product of its (nonzero) digits is 2625, while the sum is 26.
The square root of 5003005157 is about 70731.9245956167. The cubic root of 5003005157 is about 1710.3184611443.
The spelling of 5003005157 in words is "five billion, three million, five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •