Base | Representation |
---|---|
bin | 111001110110100… |
… | …110100011100101 |
3 | 2111122101100111012 |
4 | 321312212203211 |
5 | 3441434140023 |
6 | 240151352005 |
7 | 33024043244 |
oct | 7166464345 |
9 | 2448340435 |
10 | 970615013 |
11 | 458983475 |
12 | 231082605 |
13 | 12611c114 |
14 | 92c9c95b |
15 | 5a329978 |
hex | 39da68e5 |
970615013 has 2 divisors, whose sum is σ = 970615014. Its totient is φ = 970615012.
The previous prime is 970614971. The next prime is 970615027. The reversal of 970615013 is 310516079.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 615933124 + 354681889 = 24818^2 + 18833^2 .
It is a cyclic number.
It is not a de Polignac number, because 970615013 - 216 = 970549477 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (970615033) 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, 485307506 + 485307507.
It is an arithmetic number, because the mean of its divisors is an integer number (485307507).
Almost surely, 2970615013 is an apocalyptic number.
It is an amenable number.
970615013 is a deficient number, since it is larger than the sum of its proper divisors (1).
970615013 is an equidigital number, since it uses as much as digits as its factorization.
970615013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5670, while the sum is 32.
The square root of 970615013 is about 31154.6948789424. The cubic root of 970615013 is about 990.1074647822.
The spelling of 970615013 in words is "nine hundred seventy million, six hundred fifteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •