Base | Representation |
---|---|
bin | 110100101110011010… |
… | …111010000000100011 |
3 | 12102010111001200122201 |
4 | 310232122322000203 |
5 | 1411421011131011 |
6 | 42001405114031 |
7 | 4042634535250 |
oct | 645632720043 |
9 | 172114050581 |
10 | 56613380131 |
11 | 22011860470 |
12 | ab7b858917 |
13 | 5452c3a5c9 |
14 | 2a50baa427 |
15 | 171528ecc1 |
hex | d2e6ba023 |
56613380131 has 16 divisors (see below), whose sum is σ = 70875813888. Its totient is φ = 43931260800.
The previous prime is 56613380123. The next prime is 56613380143. The reversal of 56613380131 is 13108331665.
It is not a de Polignac number, because 56613380131 - 23 = 56613380123 is a prime.
It is a super-2 number, since 2×566133801312 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (56613380231) 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, 1506835 + ... + 1543948.
It is an arithmetic number, because the mean of its divisors is an integer number (4429738368).
Almost surely, 256613380131 is an apocalyptic number.
56613380131 is a deficient number, since it is larger than the sum of its proper divisors (14262433757).
56613380131 is a wasteful number, since it uses less digits than its factorization.
56613380131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3051042.
The product of its (nonzero) digits is 38880, while the sum is 37.
The spelling of 56613380131 in words is "fifty-six billion, six hundred thirteen million, three hundred eighty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •