Base | Representation |
---|---|
bin | 111010110010110… |
… | …100101000010101 |
3 | 2112202002101012112 |
4 | 322302310220111 |
5 | 4010004320201 |
6 | 241514000405 |
7 | 33305162354 |
oct | 7262645025 |
9 | 2482071175 |
10 | 986401301 |
11 | 466885996 |
12 | 236416105 |
13 | 129488612 |
14 | 9500b99b |
15 | 5b8e70bb |
hex | 3acb4a15 |
986401301 has 2 divisors, whose sum is σ = 986401302. Its totient is φ = 986401300.
The previous prime is 986401291. The next prime is 986401303. The reversal of 986401301 is 103104689.
It is a happy number.
986401301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 985897201 + 504100 = 31399^2 + 710^2 .
It is a cyclic number.
It is not a de Polignac number, because 986401301 - 26 = 986401237 is a prime.
It is a super-2 number, since 2×9864013012 = 1945975053228985202, which contains 22 as substring.
Together with 986401303, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (986401303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 493200650 + 493200651.
It is an arithmetic number, because the mean of its divisors is an integer number (493200651).
Almost surely, 2986401301 is an apocalyptic number.
It is an amenable number.
986401301 is a deficient number, since it is larger than the sum of its proper divisors (1).
986401301 is an equidigital number, since it uses as much as digits as its factorization.
986401301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 32.
The square root of 986401301 is about 31407.0262998584. The cubic root of 986401301 is about 995.4463965020.
The spelling of 986401301 in words is "nine hundred eighty-six million, four hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •