Base | Representation |
---|---|
bin | 100110111011… |
… | …100001110001 |
3 | 201012111000222 |
4 | 212323201301 |
5 | 10103032142 |
6 | 1002422425 |
7 | 152513024 |
oct | 46734161 |
9 | 21174028 |
10 | 10205297 |
11 | 5840433 |
12 | 3501a15 |
13 | 216414b |
14 | 14d91bb |
15 | d68bd2 |
hex | 9bb871 |
10205297 has 2 divisors, whose sum is σ = 10205298. Its totient is φ = 10205296.
The previous prime is 10205291. The next prime is 10205347. The reversal of 10205297 is 79250201.
10205297 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8755681 + 1449616 = 2959^2 + 1204^2 .
It is an emirp because it is prime and its reverse (79250201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10205297 is a prime.
It is not a weakly prime, because it can be changed into another prime (10205291) 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, 5102648 + 5102649.
It is an arithmetic number, because the mean of its divisors is an integer number (5102649).
Almost surely, 210205297 is an apocalyptic number.
It is an amenable number.
10205297 is a deficient number, since it is larger than the sum of its proper divisors (1).
10205297 is an equidigital number, since it uses as much as digits as its factorization.
10205297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 26.
The square root of 10205297 is about 3194.5730544159. The cubic root of 10205297 is about 216.9078232675.
Adding to 10205297 its reverse (79250201), we get a palindrome (89455498).
The spelling of 10205297 in words is "ten million, two hundred five thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •