Base | Representation |
---|---|
bin | 100111000000… |
… | …110101010101 |
3 | 201020120211212 |
4 | 213000311111 |
5 | 10104231104 |
6 | 1003111205 |
7 | 152633261 |
oct | 47006525 |
9 | 21216755 |
10 | 10227029 |
11 | 585579a |
12 | 3512505 |
13 | 2170cc7 |
14 | 15030a1 |
15 | d7036e |
hex | 9c0d55 |
10227029 has 2 divisors, whose sum is σ = 10227030. Its totient is φ = 10227028.
The previous prime is 10227017. The next prime is 10227037. The reversal of 10227029 is 92072201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9778129 + 448900 = 3127^2 + 670^2 .
It is a cyclic number.
It is not a de Polignac number, because 10227029 - 28 = 10226773 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10226995 and 10227013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10227229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5113514 + 5113515.
It is an arithmetic number, because the mean of its divisors is an integer number (5113515).
Almost surely, 210227029 is an apocalyptic number.
It is an amenable number.
10227029 is a deficient number, since it is larger than the sum of its proper divisors (1).
10227029 is an equidigital number, since it uses as much as digits as its factorization.
10227029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 23.
The square root of 10227029 is about 3197.9726390324. The cubic root of 10227029 is about 217.0616812347.
It can be divided in two parts, 102270 and 29, that multiplied together give a triangular number (2965830 = T2435).
The spelling of 10227029 in words is "ten million, two hundred twenty-seven thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •