Base | Representation |
---|---|
bin | 1010100100110011… |
… | …00011100110110001 |
3 | 112122200000201112122 |
4 | 11102121203212301 |
5 | 43111403222244 |
6 | 2335210204025 |
7 | 260456043032 |
oct | 52231434661 |
9 | 15580021478 |
10 | 5677398449 |
11 | 245381a538 |
12 | 1125423615 |
13 | 6c62b6688 |
14 | 3bc034a89 |
15 | 2336621ee |
hex | 1526639b1 |
5677398449 has 2 divisors, whose sum is σ = 5677398450. Its totient is φ = 5677398448.
The previous prime is 5677398443. The next prime is 5677398451. The reversal of 5677398449 is 9448937765.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5525246224 + 152152225 = 74332^2 + 12335^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5677398449 is a prime.
It is a super-3 number, since 3×56773984493 (a number of 30 digits) contains 333 as substring.
Together with 5677398451, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 5677398391 and 5677398400.
It is not a weakly prime, because it can be changed into another prime (5677398443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2838699224 + 2838699225.
It is an arithmetic number, because the mean of its divisors is an integer number (2838699225).
Almost surely, 25677398449 is an apocalyptic number.
It is an amenable number.
5677398449 is a deficient number, since it is larger than the sum of its proper divisors (1).
5677398449 is an equidigital number, since it uses as much as digits as its factorization.
5677398449 is an evil number, because the sum of its binary digits is even.
The product of its digits is 45722880, while the sum is 62.
The square root of 5677398449 is about 75348.5132500967. The cubic root of 5677398449 is about 1783.9518360959.
The spelling of 5677398449 in words is "five billion, six hundred seventy-seven million, three hundred ninety-eight thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •