Base | Representation |
---|---|
bin | 1010010111000111… |
… | …01100110010010101 |
3 | 112100200001012222011 |
4 | 11023203230302111 |
5 | 42343012220411 |
6 | 2315550104221 |
7 | 254563315135 |
oct | 51343546225 |
9 | 15320035864 |
10 | 5562616981 |
11 | 23a4a52519 |
12 | 10b2aab071 |
13 | 6a8598b4c |
14 | 3aaab6ac5 |
15 | 22853cc21 |
hex | 14b8ecc95 |
5562616981 has 2 divisors, whose sum is σ = 5562616982. Its totient is φ = 5562616980.
The previous prime is 5562616979. The next prime is 5562617051. The reversal of 5562616981 is 1896162655.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4142080881 + 1420536100 = 64359^2 + 37690^2 .
It is a cyclic number.
It is not a de Polignac number, because 5562616981 - 21 = 5562616979 is a prime.
It is a super-2 number, since 2×55626169812 = 61885415354619108722, which contains 22 as substring.
Together with 5562616979, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5562617981) 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 as a sum of consecutive naturals, namely, 2781308490 + 2781308491.
It is an arithmetic number, because the mean of its divisors is an integer number (2781308491).
Almost surely, 25562616981 is an apocalyptic number.
It is an amenable number.
5562616981 is a deficient number, since it is larger than the sum of its proper divisors (1).
5562616981 is an equidigital number, since it uses as much as digits as its factorization.
5562616981 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 777600, while the sum is 49.
The square root of 5562616981 is about 74582.9536891641. The cubic root of 5562616981 is about 1771.8476860259.
The spelling of 5562616981 in words is "five billion, five hundred sixty-two million, six hundred sixteen thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •