Base | Representation |
---|---|
bin | 1100001110100111… |
… | …01100101001001111 |
3 | 121221112022100111020 |
4 | 12013103230221033 |
5 | 101421123230210 |
6 | 3003235525223 |
7 | 321455022126 |
oct | 60723545117 |
9 | 17845270436 |
10 | 6565055055 |
11 | 2869891039 |
12 | 1332759813 |
13 | 80817a980 |
14 | 463c9aabd |
15 | 286551770 |
hex | 1874eca4f |
6565055055 has 64 divisors (see below), whose sum is σ = 11422763520. Its totient is φ = 3200601600.
The previous prime is 6565054981. The next prime is 6565055059. The reversal of 6565055055 is 5505505656.
It is not a de Polignac number, because 6565055055 - 212 = 6565050959 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 6565054998 and 6565055016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6565055059) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 15593745 + ... + 15594165.
It is an arithmetic number, because the mean of its divisors is an integer number (178480680).
Almost surely, 26565055055 is an apocalyptic number.
6565055055 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
6565055055 is a deficient number, since it is larger than the sum of its proper divisors (4857708465).
6565055055 is a wasteful number, since it uses less digits than its factorization.
6565055055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1032.
The product of its (nonzero) digits is 562500, while the sum is 42.
The square root of 6565055055 is about 81025.0273372370. The cubic root of 6565055055 is about 1872.4610428121.
The spelling of 6565055055 in words is "six billion, five hundred sixty-five million, fifty-five thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •