Base | Representation |
---|---|
bin | 1010011100100010… |
… | …00000110101010001 |
3 | 112110211112110100121 |
4 | 11032101000311101 |
5 | 42441130100001 |
6 | 2324251550241 |
7 | 255654432001 |
oct | 51621006521 |
9 | 15424473317 |
10 | 5608050001 |
11 | 2418663a74 |
12 | 110615b381 |
13 | 6b4b155a8 |
14 | 3b2b42001 |
15 | 22c5146a1 |
hex | 14e440d51 |
5608050001 has 2 divisors, whose sum is σ = 5608050002. Its totient is φ = 5608050000.
The previous prime is 5608049989. The next prime is 5608050017. The reversal of 5608050001 is 1000508065.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5051797776 + 556252225 = 71076^2 + 23585^2 .
It is a cyclic number.
It is not a de Polignac number, because 5608050001 - 211 = 5608047953 is a prime.
It is a super-2 number, since 2×56080500012 = 62900449627432200002, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5608050061) 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, 2804025000 + 2804025001.
It is an arithmetic number, because the mean of its divisors is an integer number (2804025001).
Almost surely, 25608050001 is an apocalyptic number.
It is an amenable number.
5608050001 is a deficient number, since it is larger than the sum of its proper divisors (1).
5608050001 is an equidigital number, since it uses as much as digits as its factorization.
5608050001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 25.
The square root of 5608050001 is about 74886.9147515105. The cubic root of 5608050001 is about 1776.6585041910.
Adding to 5608050001 its reverse (1000508065), we get a palindrome (6608558066).
The spelling of 5608050001 in words is "five billion, six hundred eight million, fifty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •