Base | Representation |
---|---|
bin | 11001100110110111101011… |
… | …01100110000011001010001 |
3 | 21101101021220101220021021021 |
4 | 30303123311230300121101 |
5 | 24340100210202313131 |
6 | 315432552051155441 |
7 | 14601226425254434 |
oct | 1463336554603121 |
9 | 241337811807237 |
10 | 56311143401041 |
11 | 16a4047046a991 |
12 | 6395587ba5b81 |
13 | 255616c4373a9 |
14 | dc968c49781b |
15 | 679bae71ee11 |
hex | 3336f5b30651 |
56311143401041 has 2 divisors, whose sum is σ = 56311143401042. Its totient is φ = 56311143401040.
The previous prime is 56311143401033. The next prime is 56311143401053. The reversal of 56311143401041 is 14010434111365.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 54648745765441 + 1662397635600 = 7392479^2 + 1289340^2 .
It is a cyclic number.
It is not a de Polignac number, because 56311143401041 - 23 = 56311143401033 is a prime.
It is a super-2 number, since 2×563111434010412 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 56311143400988 and 56311143401006.
It is not a weakly prime, because it can be changed into another prime (56311143401741) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28155571700520 + 28155571700521.
It is an arithmetic number, because the mean of its divisors is an integer number (28155571700521).
Almost surely, 256311143401041 is an apocalyptic number.
It is an amenable number.
56311143401041 is a deficient number, since it is larger than the sum of its proper divisors (1).
56311143401041 is an equidigital number, since it uses as much as digits as its factorization.
56311143401041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17280, while the sum is 34.
The spelling of 56311143401041 in words is "fifty-six trillion, three hundred eleven billion, one hundred forty-three million, four hundred one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •