Base | Representation |
---|---|
bin | 101001001001010111010… |
… | …0111111011110010000001 |
3 | 202000121211002212211210021 |
4 | 1102102232213323302001 |
5 | 1220123124301244401 |
6 | 20005530425533441 |
7 | 1122365546353621 |
oct | 122225647736201 |
9 | 22017732784707 |
10 | 5655106665601 |
11 | 18903543145a8 |
12 | 773bb7944281 |
13 | 3203747587c3 |
14 | 1579cc666881 |
15 | 9c18040a2a1 |
hex | 524ae9fbc81 |
5655106665601 has 4 divisors (see below), whose sum is σ = 5658392609604. Its totient is φ = 5651820721600.
The previous prime is 5655106665587. The next prime is 5655106665623. The reversal of 5655106665601 is 1065666015565.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1992476225601 + 3662630440000 = 1411551^2 + 1913800^2 .
It is a cyclic number.
It is not a de Polignac number, because 5655106665601 - 25 = 5655106665569 is a prime.
It is a super-3 number, since 3×56551066656013 (a number of 39 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5655106665631) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1642969420 + ... + 1642972861.
It is an arithmetic number, because the mean of its divisors is an integer number (1414598152401).
Almost surely, 25655106665601 is an apocalyptic number.
It is an amenable number.
5655106665601 is a deficient number, since it is larger than the sum of its proper divisors (3285944003).
5655106665601 is a wasteful number, since it uses less digits than its factorization.
5655106665601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3285944002.
The product of its (nonzero) digits is 4860000, while the sum is 52.
The spelling of 5655106665601 in words is "five trillion, six hundred fifty-five billion, one hundred six million, six hundred sixty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •