Base | Representation |
---|---|
bin | 110100001101111110… |
… | …110100011000110001 |
3 | 12100201112222202000000 |
4 | 310031332310120301 |
5 | 1404312200134121 |
6 | 41431404220213 |
7 | 4023305610300 |
oct | 641576643061 |
9 | 170645882000 |
10 | 56069146161 |
11 | 21862631426 |
12 | aa4953a669 |
13 | 5397268782 |
14 | 29dc7bc437 |
15 | 16d25da526 |
hex | d0dfb4631 |
56069146161 has 84 divisors (see below), whose sum is σ = 98764778484. Its totient is φ = 31720248000.
The previous prime is 56069146153. The next prime is 56069146163. The reversal of 56069146161 is 16164196065.
56069146161 is a `hidden beast` number, since 560 + 69 + 14 + 6 + 16 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 49737920400 + 6331225761 = 223020^2 + 79569^2 .
It is not a de Polignac number, because 56069146161 - 23 = 56069146153 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56069146163) 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 83 ways as a sum of consecutive naturals, for example, 3600051 + ... + 3615591.
Almost surely, 256069146161 is an apocalyptic number.
It is an amenable number.
56069146161 is a deficient number, since it is larger than the sum of its proper divisors (42695632323).
56069146161 is a wasteful number, since it uses less digits than its factorization.
56069146161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15674 (or 15652 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 45.
The spelling of 56069146161 in words is "fifty-six billion, sixty-nine million, one hundred forty-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •