Base | Representation |
---|---|
bin | 110100010100000001… |
… | …000110010011001001 |
3 | 12100222121112022220122 |
4 | 310110001012103021 |
5 | 1410014111011423 |
6 | 41445422433025 |
7 | 4025645403602 |
oct | 642401062311 |
9 | 170877468818 |
10 | 56170407113 |
11 | 21904804267 |
12 | aa77432775 |
13 | 53b22311b2 |
14 | 2a0c01ada9 |
15 | 16db43d8c8 |
hex | d140464c9 |
56170407113 has 2 divisors, whose sum is σ = 56170407114. Its totient is φ = 56170407112.
The previous prime is 56170407067. The next prime is 56170407157. The reversal of 56170407113 is 31170407165.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 39207168064 + 16963239049 = 198008^2 + 130243^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-56170407113 is a prime.
It is a super-2 number, since 2×561704071132 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (56170407193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28085203556 + 28085203557.
It is an arithmetic number, because the mean of its divisors is an integer number (28085203557).
Almost surely, 256170407113 is an apocalyptic number.
It is an amenable number.
56170407113 is a deficient number, since it is larger than the sum of its proper divisors (1).
56170407113 is an equidigital number, since it uses as much as digits as its factorization.
56170407113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17640, while the sum is 35.
The spelling of 56170407113 in words is "fifty-six billion, one hundred seventy million, four hundred seven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •