Base | Representation |
---|---|
bin | 101001001110001111000… |
… | …0001011100111011011101 |
3 | 202001121211000010202102112 |
4 | 1102130132001130323131 |
5 | 1220311034240414131 |
6 | 20014420324203405 |
7 | 1123215665452655 |
oct | 122343601347335 |
9 | 22047730122375 |
10 | 5665565560541 |
11 | 1894831070127 |
12 | 776036539565 |
13 | 321350538533 |
14 | 158301721365 |
15 | 9c59371202b |
hex | 5271e05cedd |
5665565560541 has 4 divisors (see below), whose sum is σ = 5665578580032. Its totient is φ = 5665552541052.
The previous prime is 5665565560507. The next prime is 5665565560549. The reversal of 5665565560541 is 1450655655665.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5665565560541 - 226 = 5665498451677 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5665565560549) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5833595 + ... + 6735128.
It is an arithmetic number, because the mean of its divisors is an integer number (1416394645008).
Almost surely, 25665565560541 is an apocalyptic number.
It is an amenable number.
5665565560541 is a deficient number, since it is larger than the sum of its proper divisors (13019491).
5665565560541 is a wasteful number, since it uses less digits than its factorization.
5665565560541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13019490.
The product of its (nonzero) digits is 81000000, while the sum is 59.
The spelling of 5665565560541 in words is "five trillion, six hundred sixty-five billion, five hundred sixty-five million, five hundred sixty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •