Base | Representation |
---|---|
bin | 101000100110… |
… | …001111011101 |
3 | 202000200121212 |
4 | 220212033131 |
5 | 10211024042 |
6 | 1020034205 |
7 | 156313253 |
oct | 50461735 |
9 | 22020555 |
10 | 10642397 |
11 | 6009877 |
12 | 3692965 |
13 | 228809c |
14 | 15b05d3 |
15 | e03482 |
hex | a263dd |
10642397 has 2 divisors, whose sum is σ = 10642398. Its totient is φ = 10642396.
The previous prime is 10642381. The next prime is 10642417. The reversal of 10642397 is 79324601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10621081 + 21316 = 3259^2 + 146^2 .
It is a cyclic number.
It is not a de Polignac number, because 10642397 - 24 = 10642381 is a prime.
It is a super-2 number, since 2×106423972 = 226521227811218, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10642367) 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, 5321198 + 5321199.
It is an arithmetic number, because the mean of its divisors is an integer number (5321199).
Almost surely, 210642397 is an apocalyptic number.
It is an amenable number.
10642397 is a deficient number, since it is larger than the sum of its proper divisors (1).
10642397 is an equidigital number, since it uses as much as digits as its factorization.
10642397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 32.
The square root of 10642397 is about 3262.2686891180. The cubic root of 10642397 is about 219.9614050754.
Adding to 10642397 its reverse (79324601), we get a palindrome (89966998).
The spelling of 10642397 in words is "ten million, six hundred forty-two thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •