Base | Representation |
---|---|
bin | 110100011001000110… |
… | …101101111001011001 |
3 | 12101012120011000102210 |
4 | 310121012231321121 |
5 | 1410202434003410 |
6 | 41502112145333 |
7 | 4031033056620 |
oct | 643106557131 |
9 | 171176130383 |
10 | 56255766105 |
11 | 21948a05790 |
12 | aa9bb38249 |
13 | 53c6b19886 |
14 | 2a194ba6b7 |
15 | 16e3ba0220 |
hex | d191ade59 |
56255766105 has 64 divisors (see below), whose sum is σ = 118125619200. Its totient is φ = 22148536320.
The previous prime is 56255766101. The next prime is 56255766113. The reversal of 56255766105 is 50166755265.
It is a happy number.
It is not a de Polignac number, because 56255766105 - 22 = 56255766101 is a prime.
It is a super-2 number, since 2×562557661052 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (56255766101) 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 63 ways as a sum of consecutive naturals, for example, 1259800 + ... + 1303689.
It is an arithmetic number, because the mean of its divisors is an integer number (1845712800).
Almost surely, 256255766105 is an apocalyptic number.
56255766105 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
56255766105 is an abundant number, since it is smaller than the sum of its proper divisors (61869853095).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56255766105 is a wasteful number, since it uses less digits than its factorization.
56255766105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2563534.
The product of its (nonzero) digits is 1890000, while the sum is 48.
The spelling of 56255766105 in words is "fifty-six billion, two hundred fifty-five million, seven hundred sixty-six thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •