Base | Representation |
---|---|
bin | 110100001010100001… |
… | …011000111111001001 |
3 | 12100120111202200210002 |
4 | 310022201120333021 |
5 | 1404202320200410 |
6 | 41421532132345 |
7 | 4022002331642 |
oct | 641241307711 |
9 | 170514680702 |
10 | 56011100105 |
11 | 21832895584 |
12 | aa320070b5 |
13 | 5388223cac |
14 | 29d4bcc6c9 |
15 | 16cc4717a5 |
hex | d0a858fc9 |
56011100105 has 8 divisors (see below), whose sum is σ = 69531021000. Its totient is φ = 43263746176.
The previous prime is 56011100099. The next prime is 56011100147. The reversal of 56011100105 is 50100111065.
It can be written as a sum of positive squares in 4 ways, for example, as 2946752656 + 53064347449 = 54284^2 + 230357^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-56011100105 is a prime.
It is a super-2 number, since 2×560111001052 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 193141580 + ... + 193141869.
It is an arithmetic number, because the mean of its divisors is an integer number (8691377625).
Almost surely, 256011100105 is an apocalyptic number.
It is an amenable number.
56011100105 is a deficient number, since it is larger than the sum of its proper divisors (13519920895).
56011100105 is a wasteful number, since it uses less digits than its factorization.
56011100105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 386283483.
The product of its (nonzero) digits is 150, while the sum is 20.
The spelling of 56011100105 in words is "fifty-six billion, eleven million, one hundred thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •