Base | Representation |
---|---|
bin | 11001101101000001010001… |
… | …11000001001011001100101 |
3 | 21102010111100002202012001211 |
4 | 30312200220320021121211 |
5 | 24402030442042010230 |
6 | 320114020233151421 |
7 | 14622420064643146 |
oct | 1466405070113145 |
9 | 242114302665054 |
10 | 56522455422565 |
11 | 17012047604300 |
12 | 640a51bb5b571 |
13 | 25700771ca712 |
14 | dd59b6a6bacd |
15 | 68042ad1942a |
hex | 336828e09665 |
56522455422565 has 48 divisors (see below), whose sum is σ = 77139946800000. Its totient is φ = 39681748149120.
The previous prime is 56522455422539. The next prime is 56522455422569.
56522455422565 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 56522455422565 - 25 = 56522455422533 is a prime.
It is a super-2 number, since 2×565224554225652 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56522455422569) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 87385234 + ... + 88029676.
It is an arithmetic number, because the mean of its divisors is an integer number (1607082225000).
Almost surely, 256522455422565 is an apocalyptic number.
56522455422565 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
56522455422565 is a deficient number, since it is larger than the sum of its proper divisors (20617491377435).
56522455422565 is a wasteful number, since it uses less digits than its factorization.
56522455422565 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 649498 (or 649487 counting only the distinct ones).
The product of its digits is 144000000, while the sum is 58.
The spelling of 56522455422565 in words is "fifty-six trillion, five hundred twenty-two billion, four hundred fifty-five million, four hundred twenty-two thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •