Base | Representation |
---|---|
bin | 1001101100101111… |
… | …10010011011001001 |
3 | 111102220012210020012 |
4 | 10312113302123021 |
5 | 41131014012214 |
6 | 2220411441305 |
7 | 243016144556 |
oct | 46627623311 |
9 | 14386183205 |
10 | 5207172809 |
11 | 223234a003 |
12 | 1013a56235 |
13 | 64ca57957 |
14 | 3757cda2d |
15 | 20722b03e |
hex | 1365f26c9 |
5207172809 has 2 divisors, whose sum is σ = 5207172810. Its totient is φ = 5207172808.
The previous prime is 5207172793. The next prime is 5207172823. The reversal of 5207172809 is 9082717025.
5207172809 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5152368400 + 54804409 = 71780^2 + 7403^2 .
It is a cyclic number.
It is not a de Polignac number, because 5207172809 - 24 = 5207172793 is a prime.
It is a super-2 number, since 2×52071728092 = 54229297325577900962, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (5207112809) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2603586404 + 2603586405.
It is an arithmetic number, because the mean of its divisors is an integer number (2603586405).
Almost surely, 25207172809 is an apocalyptic number.
It is an amenable number.
5207172809 is a deficient number, since it is larger than the sum of its proper divisors (1).
5207172809 is an equidigital number, since it uses as much as digits as its factorization.
5207172809 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 70560, while the sum is 41.
The square root of 5207172809 is about 72160.7428523293. The cubic root of 5207172809 is about 1733.2744302921.
The spelling of 5207172809 in words is "five billion, two hundred seven million, one hundred seventy-two thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •