Base | Representation |
---|---|
bin | 110100001010011111… |
… | …101101110100001111 |
3 | 12100120110221101121221 |
4 | 310022133231310033 |
5 | 1404202212124020 |
6 | 41421514504211 |
7 | 4021665523102 |
oct | 641237556417 |
9 | 170513841557 |
10 | 56010661135 |
11 | 218326157a0 |
12 | aa31a35067 |
13 | 53880cc250 |
14 | 29d4b16739 |
15 | 16cc3d66aa |
hex | d0a7edd0f |
56010661135 has 32 divisors (see below), whose sum is σ = 79025748480. Its totient is φ = 37571817600.
The previous prime is 56010661129. The next prime is 56010661153. The reversal of 56010661135 is 53116601065.
It is a de Polignac number, because none of the positive numbers 2k-56010661135 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 56010661135.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 892726 + ... + 953404.
It is an arithmetic number, because the mean of its divisors is an integer number (2469554640).
Almost surely, 256010661135 is an apocalyptic number.
56010661135 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
56010661135 is a deficient number, since it is larger than the sum of its proper divisors (23015087345).
56010661135 is a wasteful number, since it uses less digits than its factorization.
56010661135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61999.
The product of its (nonzero) digits is 16200, while the sum is 34.
The spelling of 56010661135 in words is "fifty-six billion, ten million, six hundred sixty-one thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •