Base | Representation |
---|---|
bin | 110100110110110111… |
… | …010110110010010101 |
3 | 12102111100122120002102 |
4 | 310312313112302111 |
5 | 1412213243241030 |
6 | 42023425451445 |
7 | 4046305004612 |
oct | 646667266225 |
9 | 172440576072 |
10 | 56755055765 |
11 | 22084827471 |
12 | abbb1a0b85 |
13 | 54763b3545 |
14 | 2a65929509 |
15 | 1722927c45 |
hex | d36dd6c95 |
56755055765 has 16 divisors (see below), whose sum is σ = 68750837760. Its totient is φ = 44974440000.
The previous prime is 56755055761. The next prime is 56755055771.
It is a happy number.
56755055765 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 56755055765 - 22 = 56755055761 is a prime.
It is a super-2 number, since 2×567550557652 (a number of 22 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (56) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a self number, because there is not a number n which added to its sum of digits gives 56755055765.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56755055761) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2148890 + ... + 2175140.
It is an arithmetic number, because the mean of its divisors is an integer number (4296927360).
Almost surely, 256755055765 is an apocalyptic number.
It is an amenable number.
56755055765 is a deficient number, since it is larger than the sum of its proper divisors (11995781995).
56755055765 is a wasteful number, since it uses less digits than its factorization.
56755055765 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30332.
The product of its (nonzero) digits is 27562500, while the sum is 56.
The spelling of 56755055765 in words is "fifty-six billion, seven hundred fifty-five million, fifty-five thousand, seven hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •