Base | Representation |
---|---|
bin | 110100101011010000… |
… | …001101100110010101 |
3 | 12101222210002011011010 |
4 | 310223100031212111 |
5 | 1411313410321031 |
6 | 41552230202433 |
7 | 4041421102611 |
oct | 645320154625 |
9 | 171883064133 |
10 | 56560245141 |
11 | 21a94869354 |
12 | ab65ab3419 |
13 | 5444c2529a |
14 | 2a47ad8341 |
15 | 1710796246 |
hex | d2b40d995 |
56560245141 has 16 divisors (see below), whose sum is σ = 76576537728. Its totient is φ = 37126790400.
The previous prime is 56560245107. The next prime is 56560245151. The reversal of 56560245141 is 14154206565.
It is not a de Polignac number, because 56560245141 - 27 = 56560245013 is a prime.
It is a super-2 number, since 2×565602451412 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 56560245141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56560245151) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 12376 + ... + 336561.
It is an arithmetic number, because the mean of its divisors is an integer number (4786033608).
Almost surely, 256560245141 is an apocalyptic number.
It is an amenable number.
56560245141 is a deficient number, since it is larger than the sum of its proper divisors (20016292587).
56560245141 is a wasteful number, since it uses less digits than its factorization.
56560245141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349772.
The product of its (nonzero) digits is 144000, while the sum is 39.
The spelling of 56560245141 in words is "fifty-six billion, five hundred sixty million, two hundred forty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •