Base | Representation |
---|---|
bin | 1011101000100000… |
… | …10100011000000001 |
3 | 121010020211022002101 |
4 | 11310100110120001 |
5 | 100242310331423 |
6 | 2511420350401 |
7 | 310524020266 |
oct | 56420243001 |
9 | 17106738071 |
10 | 6245402113 |
11 | 2715404055 |
12 | 12636a5401 |
13 | 786b8b712 |
14 | 43364d26d |
15 | 26845e7ad |
hex | 174414601 |
6245402113 has 2 divisors, whose sum is σ = 6245402114. Its totient is φ = 6245402112.
The previous prime is 6245402063. The next prime is 6245402131. The reversal of 6245402113 is 3112045426.
Together with next prime (6245402131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5874762609 + 370639504 = 76647^2 + 19252^2 .
It is a cyclic number.
It is not a de Polignac number, because 6245402113 - 217 = 6245271041 is a prime.
It is not a weakly prime, because it can be changed into another prime (6245402143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3122701056 + 3122701057.
It is an arithmetic number, because the mean of its divisors is an integer number (3122701057).
Almost surely, 26245402113 is an apocalyptic number.
It is an amenable number.
6245402113 is a deficient number, since it is larger than the sum of its proper divisors (1).
6245402113 is an equidigital number, since it uses as much as digits as its factorization.
6245402113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 28.
The square root of 6245402113 is about 79027.8565633663. The cubic root of 6245402113 is about 1841.5639382277.
Adding to 6245402113 its reverse (3112045426), we get a palindrome (9357447539).
The spelling of 6245402113 in words is "six billion, two hundred forty-five million, four hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •