Base | Representation |
---|---|
bin | 1010011100011010… |
… | …11101110011011001 |
3 | 112110202210012202102 |
4 | 11032031131303121 |
5 | 42440410320324 |
6 | 2324220013145 |
7 | 255643506614 |
oct | 51615356331 |
9 | 15422705672 |
10 | 5607120089 |
11 | 241808934a |
12 | 11059911b5 |
13 | 6b487b24c |
14 | 3b297d17b |
15 | 22c3cddae |
hex | 14e35dcd9 |
5607120089 has 2 divisors, whose sum is σ = 5607120090. Its totient is φ = 5607120088.
The previous prime is 5607120073. The next prime is 5607120091. The reversal of 5607120089 is 9800217065.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5178961225 + 428158864 = 71965^2 + 20692^2 .
It is a cyclic number.
It is not a de Polignac number, because 5607120089 - 24 = 5607120073 is a prime.
It is a super-3 number, since 3×56071200893 (a number of 30 digits) contains 333 as substring.
Together with 5607120091, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (5607120059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2803560044 + 2803560045.
It is an arithmetic number, because the mean of its divisors is an integer number (2803560045).
Almost surely, 25607120089 is an apocalyptic number.
It is an amenable number.
5607120089 is a deficient number, since it is larger than the sum of its proper divisors (1).
5607120089 is an equidigital number, since it uses as much as digits as its factorization.
5607120089 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30240, while the sum is 38.
The square root of 5607120089 is about 74880.7057191637. The cubic root of 5607120089 is about 1776.5602984933.
The spelling of 5607120089 in words is "five billion, six hundred seven million, one hundred twenty thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •