Base | Representation |
---|---|
bin | 1101000100000011… |
… | …00111111011100101 |
3 | 200002202202122200112 |
4 | 12202001213323211 |
5 | 103330401130424 |
6 | 3115531222405 |
7 | 335540040401 |
oct | 64201477345 |
9 | 20082678615 |
10 | 7013301989 |
11 | 2a7990a651 |
12 | 14388a7a05 |
13 | 879cb2745 |
14 | 4a7620101 |
15 | 2b0a9560e |
hex | 1a2067ee5 |
7013301989 has 2 divisors, whose sum is σ = 7013301990. Its totient is φ = 7013301988.
The previous prime is 7013301961. The next prime is 7013302013. The reversal of 7013301989 is 9891033107.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5724132964 + 1289169025 = 75658^2 + 35905^2 .
It is a cyclic number.
It is not a de Polignac number, because 7013301989 - 216 = 7013236453 is a prime.
It is a super-2 number, since 2×70133019892 = 98372809577822712242, 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 (7013301959) 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, 3506650994 + 3506650995.
It is an arithmetic number, because the mean of its divisors is an integer number (3506650995).
Almost surely, 27013301989 is an apocalyptic number.
It is an amenable number.
7013301989 is a deficient number, since it is larger than the sum of its proper divisors (1).
7013301989 is an equidigital number, since it uses as much as digits as its factorization.
7013301989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40824, while the sum is 41.
The square root of 7013301989 is about 83745.4595127402. The cubic root of 7013301989 is about 1914.1421203185.
The spelling of 7013301989 in words is "seven billion, thirteen million, three hundred one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •