Base | Representation |
---|---|
bin | 100110101010… |
… | …101010011101 |
3 | 201001222021121 |
4 | 212222222131 |
5 | 10043324341 |
6 | 1001130541 |
7 | 152104444 |
oct | 46525235 |
9 | 21058247 |
10 | 10136221 |
11 | 57a3547 |
12 | 3489a51 |
13 | 213b884 |
14 | 14bbd5b |
15 | d534d1 |
hex | 9aaa9d |
10136221 has 2 divisors, whose sum is σ = 10136222. Its totient is φ = 10136220.
The previous prime is 10136207. The next prime is 10136239. The reversal of 10136221 is 12263101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6579225 + 3556996 = 2565^2 + 1886^2 .
It is an emirp because it is prime and its reverse (12263101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10136221 - 215 = 10103453 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10136195 and 10136204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10136281) 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, 5068110 + 5068111.
It is an arithmetic number, because the mean of its divisors is an integer number (5068111).
Almost surely, 210136221 is an apocalyptic number.
It is an amenable number.
10136221 is a deficient number, since it is larger than the sum of its proper divisors (1).
10136221 is an equidigital number, since it uses as much as digits as its factorization.
10136221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 10136221 is about 3183.7432371346. The cubic root of 10136221 is about 216.4173244729.
Adding to 10136221 its reverse (12263101), we get a palindrome (22399322).
The spelling of 10136221 in words is "ten million, one hundred thirty-six thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •