Base | Representation |
---|---|
bin | 111000000100010… |
… | …000101110101101 |
3 | 2102112222112010212 |
4 | 320010100232231 |
5 | 3411301004242 |
6 | 233201112205 |
7 | 32211214106 |
oct | 7004205655 |
9 | 2375875125 |
10 | 940641197 |
11 | 442a70721 |
12 | 223028665 |
13 | 11cb56032 |
14 | 8ccd93ad |
15 | 578a8782 |
hex | 38110bad |
940641197 has 2 divisors, whose sum is σ = 940641198. Its totient is φ = 940641196.
The previous prime is 940641181. The next prime is 940641199. The reversal of 940641197 is 791146049.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 678654601 + 261986596 = 26051^2 + 16186^2 .
It is a cyclic number.
It is not a de Polignac number, because 940641197 - 24 = 940641181 is a prime.
It is a super-2 number, since 2×9406411972 = 1769611722987185618, which contains 22 as substring.
Together with 940641199, 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 (940641199) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 470320598 + 470320599.
It is an arithmetic number, because the mean of its divisors is an integer number (470320599).
Almost surely, 2940641197 is an apocalyptic number.
It is an amenable number.
940641197 is a deficient number, since it is larger than the sum of its proper divisors (1).
940641197 is an equidigital number, since it uses as much as digits as its factorization.
940641197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54432, while the sum is 41.
The square root of 940641197 is about 30669.8744210015. The cubic root of 940641197 is about 979.8087913086.
The spelling of 940641197 in words is "nine hundred forty million, six hundred forty-one thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •