Base | Representation |
---|---|
bin | 110100010000101000… |
… | …100100011100110101 |
3 | 12100211122201112102200 |
4 | 310100220210130311 |
5 | 1404410043122430 |
6 | 41440034055113 |
7 | 4024356054501 |
oct | 642050443465 |
9 | 170748645380 |
10 | 56113645365 |
11 | 21885765328 |
12 | aa6041a499 |
13 | 53a354916b |
14 | 2a04683301 |
15 | 16d647a460 |
hex | d10a24735 |
56113645365 has 48 divisors (see below), whose sum is σ = 100388808000. Its totient is φ = 28980838656.
The previous prime is 56113645363. The next prime is 56113645369. The reversal of 56113645365 is 56354631165.
It is a happy number.
56113645365 is a `hidden beast` number, since 5 + 6 + 1 + 136 + 453 + 65 = 666.
It is not a de Polignac number, because 56113645365 - 21 = 56113645363 is a prime.
It is a super-2 number, since 2×561136453652 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 56113645365.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56113645363) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 20161 + ... + 335609.
It is an arithmetic number, because the mean of its divisors is an integer number (2091433500).
Almost surely, 256113645365 is an apocalyptic number.
It is an amenable number.
56113645365 is a deficient number, since it is larger than the sum of its proper divisors (44275162635).
56113645365 is a wasteful number, since it uses less digits than its factorization.
56113645365 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 315586 (or 315583 counting only the distinct ones).
The product of its digits is 972000, while the sum is 45.
The spelling of 56113645365 in words is "fifty-six billion, one hundred thirteen million, six hundred forty-five thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •