Base | Representation |
---|---|
bin | 100000110101101101001… |
… | …001000100101101111000 |
3 | 21222201220112100022222001 |
4 | 200311231021010231320 |
5 | 243433144331104220 |
6 | 4444413015310344 |
7 | 322016566241356 |
oct | 40655511045570 |
9 | 7881815308861 |
10 | 2256688925560 |
11 | 7a0069080893 |
12 | 30544067b3b4 |
13 | 134a60351784 |
14 | 7b31d7a47d6 |
15 | 3da7d16580a |
hex | 20d6d244b78 |
2256688925560 has 32 divisors (see below), whose sum is σ = 5163610258800. Its totient is φ = 887375983360.
The previous prime is 2256688925551. The next prime is 2256688925563. The reversal of 2256688925560 is 655298866522.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 2256688925492 and 2256688925501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2256688925563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 478109701 + ... + 478114420.
Almost surely, 22256688925560 is an apocalyptic number.
2256688925560 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2256688925560 is an abundant number, since it is smaller than the sum of its proper divisors (2906921333240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2256688925560 is a wasteful number, since it uses less digits than its factorization.
2256688925560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 956224191 (or 956224187 counting only the distinct ones).
The product of its (nonzero) digits is 124416000, while the sum is 64.
The spelling of 2256688925560 in words is "two trillion, two hundred fifty-six billion, six hundred eighty-eight million, nine hundred twenty-five thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •