Base | Representation |
---|---|
bin | 1001010100101100… |
… | …11110000010011001 |
3 | 110220211201202220222 |
4 | 10222112132002121 |
5 | 40222402004234 |
6 | 2144405125425 |
7 | 235020024056 |
oct | 45226360231 |
9 | 13824652828 |
10 | 5005500569 |
11 | 2139524733 |
12 | b783b9875 |
13 | 61a036474 |
14 | 356ad402d |
15 | 1e469142e |
hex | 12a59e099 |
5005500569 has 2 divisors, whose sum is σ = 5005500570. Its totient is φ = 5005500568.
The previous prime is 5005500541. The next prime is 5005500589. The reversal of 5005500569 is 9650055005.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4716942400 + 288558169 = 68680^2 + 16987^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5005500569 is a prime.
It is a super-2 number, since 2×50055005692 = 50110071892518647522, 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 (5005500509) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2502750284 + 2502750285.
It is an arithmetic number, because the mean of its divisors is an integer number (2502750285).
Almost surely, 25005500569 is an apocalyptic number.
It is an amenable number.
5005500569 is a deficient number, since it is larger than the sum of its proper divisors (1).
5005500569 is an equidigital number, since it uses as much as digits as its factorization.
5005500569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 33750, while the sum is 35.
The square root of 5005500569 is about 70749.5623237346. The cubic root of 5005500569 is about 1710.6027729183.
The spelling of 5005500569 in words is "five billion, five million, five hundred thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •