Base | Representation |
---|---|
bin | 110101000011001010… |
… | …001000100111011011 |
3 | 12110000201202002220212 |
4 | 311003022020213123 |
5 | 1413124043230201 |
6 | 42100114241335 |
7 | 4054361050520 |
oct | 650312104733 |
9 | 173021662825 |
10 | 56961305051 |
11 | 22180198622 |
12 | b05828624b |
13 | 54aa048141 |
14 | 2a85097147 |
15 | 1735ab8abb |
hex | d432889db |
56961305051 has 16 divisors (see below), whose sum is σ = 69470724096. Its totient is φ = 45590138496.
The previous prime is 56961305041. The next prime is 56961305069. The reversal of 56961305051 is 15050316965.
It is a happy number.
It is not a de Polignac number, because 56961305051 - 214 = 56961288667 is a prime.
It is a super-2 number, since 2×569613050512 (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 (56961305041) 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, 1869401 + ... + 1899626.
It is an arithmetic number, because the mean of its divisors is an integer number (4341920256).
Almost surely, 256961305051 is an apocalyptic number.
56961305051 is a deficient number, since it is larger than the sum of its proper divisors (12509419045).
56961305051 is a wasteful number, since it uses less digits than its factorization.
56961305051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3769178.
The product of its (nonzero) digits is 121500, while the sum is 41.
The spelling of 56961305051 in words is "fifty-six billion, nine hundred sixty-one million, three hundred five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •