Base | Representation |
---|---|
bin | 1001101110000001… |
… | …01000010010000001 |
3 | 111110122100201121001 |
4 | 10313000220102001 |
5 | 41141234113134 |
6 | 2221433132001 |
7 | 243206145466 |
oct | 46700502201 |
9 | 14418321531 |
10 | 5217879169 |
11 | 22383a1938 |
12 | 101755a001 |
13 | 652035b89 |
14 | 376db966d |
15 | 208143414 |
hex | 137028481 |
5217879169 has 2 divisors, whose sum is σ = 5217879170. Its totient is φ = 5217879168.
The previous prime is 5217879151. The next prime is 5217879179. The reversal of 5217879169 is 9619787125.
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., 4158702144 + 1059177025 = 64488^2 + 32545^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5217879169 is a prime.
It is a super-2 number, since 2×52178791692 = 54452526044568261122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5217879109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2608939584 + 2608939585.
It is an arithmetic number, because the mean of its divisors is an integer number (2608939585).
Almost surely, 25217879169 is an apocalyptic number.
It is an amenable number.
5217879169 is a deficient number, since it is larger than the sum of its proper divisors (1).
5217879169 is an equidigital number, since it uses as much as digits as its factorization.
5217879169 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1905120, while the sum is 55.
The square root of 5217879169 is about 72234.8888626542. Note that the first 4 decimals coincide. The cubic root of 5217879169 is about 1734.4615336048.
The spelling of 5217879169 in words is "five billion, two hundred seventeen million, eight hundred seventy-nine thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •