Base | Representation |
---|---|
bin | 1001101100011001… |
… | …00010110101111001 |
3 | 111102200200001010221 |
4 | 10312030202311321 |
5 | 41124240203101 |
6 | 2220224340041 |
7 | 242652120544 |
oct | 46614426571 |
9 | 14380601127 |
10 | 5204225401 |
11 | 2230716631 |
12 | 1012a74621 |
13 | 64c26521b |
14 | 37526385b |
15 | 206d47aa1 |
hex | 136322d79 |
5204225401 has 2 divisors, whose sum is σ = 5204225402. Its totient is φ = 5204225400.
The previous prime is 5204225333. The next prime is 5204225423. The reversal of 5204225401 is 1045224025.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4227600400 + 976625001 = 65020^2 + 31251^2 .
It is a cyclic number.
It is not a de Polignac number, because 5204225401 - 215 = 5204192633 is a prime.
It is a super-2 number, since 2×52042254012 = 54167924048827221602, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5204225461) 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, 2602112700 + 2602112701.
It is an arithmetic number, because the mean of its divisors is an integer number (2602112701).
Almost surely, 25204225401 is an apocalyptic number.
It is an amenable number.
5204225401 is a deficient number, since it is larger than the sum of its proper divisors (1).
5204225401 is an equidigital number, since it uses as much as digits as its factorization.
5204225401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3200, while the sum is 25.
The square root of 5204225401 is about 72140.3174445469. The cubic root of 5204225401 is about 1732.9473410189.
Adding to 5204225401 its reverse (1045224025), we get a palindrome (6249449426).
The spelling of 5204225401 in words is "five billion, two hundred four million, two hundred twenty-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •