Base | Representation |
---|---|
bin | 1001010101100111… |
… | …01110110100110101 |
3 | 110221101011111110212 |
4 | 10222303232310311 |
5 | 40231332442014 |
6 | 2145241355205 |
7 | 235142153243 |
oct | 45263566465 |
9 | 13841144425 |
10 | 5013171509 |
11 | 2142893a55 |
12 | b7aa98b05 |
13 | 61b7c0b98 |
14 | 357b2d793 |
15 | 1e51a923e |
hex | 12aceed35 |
5013171509 has 2 divisors, whose sum is σ = 5013171510. Its totient is φ = 5013171508.
The previous prime is 5013171431. The next prime is 5013171529. The reversal of 5013171509 is 9051713105.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4736880625 + 276290884 = 68825^2 + 16622^2 .
It is a cyclic number.
It is not a de Polignac number, because 5013171509 - 28 = 5013171253 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5013171529) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2506585754 + 2506585755.
It is an arithmetic number, because the mean of its divisors is an integer number (2506585755).
Almost surely, 25013171509 is an apocalyptic number.
It is an amenable number.
5013171509 is a deficient number, since it is larger than the sum of its proper divisors (1).
5013171509 is an equidigital number, since it uses as much as digits as its factorization.
5013171509 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4725, while the sum is 32.
The square root of 5013171509 is about 70803.7534951361. The cubic root of 5013171509 is about 1711.4761610125.
The spelling of 5013171509 in words is "five billion, thirteen million, one hundred seventy-one thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •