Base | Representation |
---|---|
bin | 101000101111111101101… |
… | …1001010100011001000111 |
3 | 201211102000122220110120012 |
4 | 1101133323121110121013 |
5 | 1213224421341330111 |
6 | 15524510051500435 |
7 | 1115425046266343 |
oct | 121377331243107 |
9 | 21742018813505 |
10 | 5600560105031 |
11 | 186a20319a281 |
12 | 7655142b771b |
13 | 318190a8c568 |
14 | 1550d618a623 |
15 | 9aa3b82b48b |
hex | 517fb654647 |
5600560105031 has 2 divisors, whose sum is σ = 5600560105032. Its totient is φ = 5600560105030.
The previous prime is 5600560104949. The next prime is 5600560105033. The reversal of 5600560105031 is 1305010650065.
5600560105031 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5600560105031 - 214 = 5600560088647 is a prime.
It is a super-2 number, since 2×56005601050312 (a number of 26 digits) contains 22 as substring.
Together with 5600560105033, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5600560105033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2800280052515 + 2800280052516.
It is an arithmetic number, because the mean of its divisors is an integer number (2800280052516).
Almost surely, 25600560105031 is an apocalyptic number.
5600560105031 is a deficient number, since it is larger than the sum of its proper divisors (1).
5600560105031 is an equidigital number, since it uses as much as digits as its factorization.
5600560105031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13500, while the sum is 32.
Adding to 5600560105031 its reverse (1305010650065), we get a palindrome (6905570755096).
The spelling of 5600560105031 in words is "five trillion, six hundred billion, five hundred sixty million, one hundred five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •