Base | Representation |
---|---|
bin | 110100010001101100… |
… | …111010001101011001 |
3 | 12100212220102201002002 |
4 | 310101230322031121 |
5 | 1404424134412111 |
6 | 41441514050345 |
7 | 4024664250536 |
oct | 642154721531 |
9 | 170786381062 |
10 | 56131560281 |
11 | 21894891045 |
12 | aa664199b5 |
13 | 53a717c4c4 |
14 | 2a06bc7d8d |
15 | 16d7d1863b |
hex | d11b3a359 |
56131560281 has 2 divisors, whose sum is σ = 56131560282. Its totient is φ = 56131560280.
The previous prime is 56131560229. The next prime is 56131560319. The reversal of 56131560281 is 18206513165.
56131560281 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (56131560319) can be obtained adding 56131560281 to its sum of digits (38).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 47749242256 + 8382318025 = 218516^2 + 91555^2 .
It is a cyclic number.
It is not a de Polignac number, because 56131560281 - 218 = 56131298137 is a prime.
It is a super-2 number, since 2×561315602812 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (56131560481) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28065780140 + 28065780141.
It is an arithmetic number, because the mean of its divisors is an integer number (28065780141).
Almost surely, 256131560281 is an apocalyptic number.
It is an amenable number.
56131560281 is a deficient number, since it is larger than the sum of its proper divisors (1).
56131560281 is an equidigital number, since it uses as much as digits as its factorization.
56131560281 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 43200, while the sum is 38.
The spelling of 56131560281 in words is "fifty-six billion, one hundred thirty-one million, five hundred sixty thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •