Base | Representation |
---|---|
bin | 110100110001010101… |
… | …011100011111001001 |
3 | 12102020220002001212001 |
4 | 310301111130133021 |
5 | 1412021020431022 |
6 | 42010313151001 |
7 | 4044100302001 |
oct | 646125343711 |
9 | 172226061761 |
10 | 56662280137 |
11 | 2203741a7a1 |
12 | ab940bb461 |
13 | 54600cc118 |
14 | 2a57499001 |
15 | 17196edb27 |
hex | d3155c7c9 |
56662280137 has 8 divisors (see below), whose sum is σ = 57482026920. Its totient is φ = 55846602240.
The previous prime is 56662280107. The next prime is 56662280173. The reversal of 56662280137 is 73108226665.
It can be written as a sum of positive squares in 4 ways, for example, as 2020412601 + 54641867536 = 44949^2 + 233756^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 56662280137 - 27 = 56662280009 is a prime.
It is a super-2 number, since 2×566622801372 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (56662280107) 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, 989164 + ... + 1044877.
It is an arithmetic number, because the mean of its divisors is an integer number (7185253365).
Almost surely, 256662280137 is an apocalyptic number.
It is an amenable number.
56662280137 is a deficient number, since it is larger than the sum of its proper divisors (819746783).
56662280137 is a wasteful number, since it uses less digits than its factorization.
56662280137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2034443.
The product of its (nonzero) digits is 725760, while the sum is 46.
The spelling of 56662280137 in words is "fifty-six billion, six hundred sixty-two million, two hundred eighty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •