Base | Representation |
---|---|
bin | 101000100111… |
… | …111001110001 |
3 | 202001000221212 |
4 | 220213321301 |
5 | 10211233301 |
6 | 1020125505 |
7 | 156342143 |
oct | 50477161 |
9 | 22030855 |
10 | 10649201 |
11 | 60139a2 |
12 | 3696895 |
13 | 228b204 |
14 | 15b2c93 |
15 | e054bb |
hex | a27e71 |
10649201 has 2 divisors, whose sum is σ = 10649202. Its totient is φ = 10649200.
The previous prime is 10649189. The next prime is 10649203. The reversal of 10649201 is 10294601.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10394176 + 255025 = 3224^2 + 505^2 .
It is an emirp because it is prime and its reverse (10294601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10649201 - 218 = 10387057 is a prime.
It is a super-3 number, since 3×106492013 (a number of 22 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 10649203, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10649203) 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, 5324600 + 5324601.
It is an arithmetic number, because the mean of its divisors is an integer number (5324601).
Almost surely, 210649201 is an apocalyptic number.
It is an amenable number.
10649201 is a deficient number, since it is larger than the sum of its proper divisors (1).
10649201 is an equidigital number, since it uses as much as digits as its factorization.
10649201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 23.
The square root of 10649201 is about 3263.3113550503. The cubic root of 10649201 is about 220.0082710389.
The spelling of 10649201 in words is "ten million, six hundred forty-nine thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •