Base | Representation |
---|---|
bin | 101001001001100110110… |
… | …0110000011001111011101 |
3 | 202000200011022121020221101 |
4 | 1102103031212003033131 |
5 | 1220130210310444230 |
6 | 20010054150433101 |
7 | 1122414456032413 |
oct | 122231546031735 |
9 | 22020138536841 |
10 | 5655626265565 |
11 | 18905a0648761 |
12 | 774121962791 |
13 | 3204282b3bc3 |
14 | 157a3b6812b3 |
15 | 9c1b0d45aca |
hex | 524cd9833dd |
5655626265565 has 64 divisors (see below), whose sum is σ = 7208913406464. Its totient is φ = 4250655940608.
The previous prime is 5655626265563. The next prime is 5655626265571.
It is a happy number.
5655626265565 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 5655626265565 - 21 = 5655626265563 is a prime.
It is a super-2 number, since 2×56556262655652 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5655626265497 and 5655626265506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5655626265563) 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, 3641741829 + ... + 3641743381.
It is an arithmetic number, because the mean of its divisors is an integer number (112639271976).
Almost surely, 25655626265565 is an apocalyptic number.
It is an amenable number.
5655626265565 is a deficient number, since it is larger than the sum of its proper divisors (1553287140899).
5655626265565 is a wasteful number, since it uses less digits than its factorization.
5655626265565 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3190.
The product of its digits is 486000000, while the sum is 64.
The spelling of 5655626265565 in words is "five trillion, six hundred fifty-five billion, six hundred twenty-six million, two hundred sixty-five thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •