Base | Representation |
---|---|
bin | 1010011011101110… |
… | …01000011000010001 |
3 | 112110100202202022112 |
4 | 11031313020120101 |
5 | 42432410441134 |
6 | 2323450315105 |
7 | 255542653103 |
oct | 51567103021 |
9 | 15410682275 |
10 | 5601265169 |
11 | 241484a475 |
12 | 1103a28a95 |
13 | 6b35ab2b6 |
14 | 3b1c97573 |
15 | 22bb241ce |
hex | 14ddc8611 |
5601265169 has 2 divisors, whose sum is σ = 5601265170. Its totient is φ = 5601265168.
The previous prime is 5601265157. The next prime is 5601265177. The reversal of 5601265169 is 9615621065.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4240614400 + 1360650769 = 65120^2 + 36887^2 .
It is a cyclic number.
It is not a de Polignac number, because 5601265169 - 28 = 5601264913 is a prime.
It is a super-2 number, since 2×56012651692 = 62748342986905197122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5601265129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2800632584 + 2800632585.
It is an arithmetic number, because the mean of its divisors is an integer number (2800632585).
Almost surely, 25601265169 is an apocalyptic number.
It is an amenable number.
5601265169 is a deficient number, since it is larger than the sum of its proper divisors (1).
5601265169 is an equidigital number, since it uses as much as digits as its factorization.
5601265169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 97200, while the sum is 41.
The square root of 5601265169 is about 74841.6005240401. The cubic root of 5601265169 is about 1775.9417253938.
The spelling of 5601265169 in words is "five billion, six hundred one million, two hundred sixty-five thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •