Base | Representation |
---|---|
bin | 1101011011000… |
… | …1101110110001 |
3 | 10220221110112021 |
4 | 3112301232301 |
5 | 103403140023 |
6 | 5330431441 |
7 | 1252364161 |
oct | 326615661 |
9 | 126843467 |
10 | 56302513 |
11 | 29865a03 |
12 | 16a32581 |
13 | b883cc7 |
14 | 76985a1 |
15 | 4e2235d |
hex | 35b1bb1 |
56302513 has 2 divisors, whose sum is σ = 56302514. Its totient is φ = 56302512.
The previous prime is 56302511. The next prime is 56302517. The reversal of 56302513 is 31520365.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 54420129 + 1882384 = 7377^2 + 1372^2 .
It is a cyclic number.
It is not a de Polignac number, because 56302513 - 21 = 56302511 is a prime.
It is a super-3 number, since 3×563025133 (a number of 24 digits) contains 333 as substring.
Together with 56302511, it forms a pair of twin primes.
It is the 7504-th Hogben number.
It is equal to p3355360 and since 56302513 and 3355360 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (56302511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28151256 + 28151257.
It is an arithmetic number, because the mean of its divisors is an integer number (28151257).
Almost surely, 256302513 is an apocalyptic number.
It is an amenable number.
56302513 is a deficient number, since it is larger than the sum of its proper divisors (1).
56302513 is an equidigital number, since it uses as much as digits as its factorization.
56302513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 25.
The square root of 56302513 is about 7503.5000499767. The cubic root of 56302513 is about 383.2739123186.
Adding to 56302513 its reverse (31520365), we get a palindrome (87822878).
The spelling of 56302513 in words is "fifty-six million, three hundred two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.148 sec. • engine limits •