Base | Representation |
---|---|
bin | 101101000101110… |
… | …1101110100011001 |
3 | 10220110000102012121 |
4 | 1122023231310121 |
5 | 11044313130242 |
6 | 410045141241 |
7 | 52331315026 |
oct | 13213556431 |
9 | 3813012177 |
10 | 1513020697 |
11 | 707073931 |
12 | 36285a821 |
13 | 1b1600a26 |
14 | 104d3254d |
15 | 8cc6c667 |
hex | 5a2edd19 |
1513020697 has 2 divisors, whose sum is σ = 1513020698. Its totient is φ = 1513020696.
The previous prime is 1513020667. The next prime is 1513020709. The reversal of 1513020697 is 7960203151.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1460080521 + 52940176 = 38211^2 + 7276^2 .
It is an emirp because it is prime and its reverse (7960203151) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1513020697 - 215 = 1512987929 is a prime.
It is not a weakly prime, because it can be changed into another prime (1513020617) 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, 756510348 + 756510349.
It is an arithmetic number, because the mean of its divisors is an integer number (756510349).
Almost surely, 21513020697 is an apocalyptic number.
It is an amenable number.
1513020697 is a deficient number, since it is larger than the sum of its proper divisors (1).
1513020697 is an equidigital number, since it uses as much as digits as its factorization.
1513020697 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11340, while the sum is 34.
The square root of 1513020697 is about 38897.5667233826. The cubic root of 1513020697 is about 1148.0169218228.
The spelling of 1513020697 in words is "one billion, five hundred thirteen million, twenty thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •