Base | Representation |
---|---|
bin | 1001100000011110… |
… | …01001101010100101 |
3 | 111011201112112101102 |
4 | 10300033021222211 |
5 | 40423141323123 |
6 | 2202253405445 |
7 | 240326240651 |
oct | 46017115245 |
9 | 14151475342 |
10 | 5104245413 |
11 | 218a239143 |
12 | ba5499885 |
13 | 63462a877 |
14 | 365c79a61 |
15 | 1ed199028 |
hex | 1303c9aa5 |
5104245413 has 2 divisors, whose sum is σ = 5104245414. Its totient is φ = 5104245412.
The previous prime is 5104245409. The next prime is 5104245437. The reversal of 5104245413 is 3145424015.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4939559524 + 164685889 = 70282^2 + 12833^2 .
It is a cyclic number.
It is not a de Polignac number, because 5104245413 - 22 = 5104245409 is a prime.
It is a super-2 number, since 2×51042454132 = 52106642472263081138, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5104245463) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2552122706 + 2552122707.
It is an arithmetic number, because the mean of its divisors is an integer number (2552122707).
Almost surely, 25104245413 is an apocalyptic number.
It is an amenable number.
5104245413 is a deficient number, since it is larger than the sum of its proper divisors (1).
5104245413 is an equidigital number, since it uses as much as digits as its factorization.
5104245413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9600, while the sum is 29.
The square root of 5104245413 is about 71444.0019385812. The cubic root of 5104245413 is about 1721.7781112663.
Adding to 5104245413 its reverse (3145424015), we get a palindrome (8249669428).
The spelling of 5104245413 in words is "five billion, one hundred four million, two hundred forty-five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •