Base | Representation |
---|---|
bin | 101001001110001010000… |
… | …0101001001000010101101 |
3 | 202001121101101021011221002 |
4 | 1102130110011021002231 |
5 | 1220310214040134001 |
6 | 20014352005050045 |
7 | 1123211601601622 |
oct | 122342405110255 |
9 | 22047341234832 |
10 | 5665398755501 |
11 | 18947559a0021 |
12 | 775baa6b6925 |
13 | 321324b04524 |
14 | 1582c7500349 |
15 | 9c583c6346b |
hex | 527141490ad |
5665398755501 has 2 divisors, whose sum is σ = 5665398755502. Its totient is φ = 5665398755500.
The previous prime is 5665398755441. The next prime is 5665398755507. The reversal of 5665398755501 is 1055578935665.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4611283812100 + 1054114943401 = 2147390^2 + 1026701^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5665398755501 is a prime.
It is a super-2 number, since 2×56653987555012 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5665398755507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2832699377750 + 2832699377751.
It is an arithmetic number, because the mean of its divisors is an integer number (2832699377751).
Almost surely, 25665398755501 is an apocalyptic number.
It is an amenable number.
5665398755501 is a deficient number, since it is larger than the sum of its proper divisors (1).
5665398755501 is an equidigital number, since it uses as much as digits as its factorization.
5665398755501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 170100000, while the sum is 65.
The spelling of 5665398755501 in words is "five trillion, six hundred sixty-five billion, three hundred ninety-eight million, seven hundred fifty-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •