Base | Representation |
---|---|
bin | 1001000110001000101101… |
… | …0011110110100010101001 |
3 | 1022102002101100121121210012 |
4 | 2101202023103312202221 |
5 | 2302324042400232444 |
6 | 33134223342501305 |
7 | 2051356424514632 |
oct | 221421323664251 |
9 | 38362340547705 |
10 | 10001021102249 |
11 | 3206455760281 |
12 | 1156321894835 |
13 | 577127873738 |
14 | 2680a29b0889 |
15 | 1252398e1b9e |
hex | 9188b4f68a9 |
10001021102249 has 2 divisors, whose sum is σ = 10001021102250. Its totient is φ = 10001021102248.
The previous prime is 10001021102161. The next prime is 10001021102251. The reversal of 10001021102249 is 94220112010001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7357005264400 + 2644015837849 = 2712380^2 + 1626043^2 .
It is a cyclic number.
It is not a de Polignac number, because 10001021102249 - 28 = 10001021101993 is a prime.
It is a super-3 number, since 3×100010211022493 (a number of 40 digits) contains 333 as substring.
It is a Sophie Germain prime.
Together with 10001021102251, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10001021102279) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000510551124 + 5000510551125.
It is an arithmetic number, because the mean of its divisors is an integer number (5000510551125).
Almost surely, 210001021102249 is an apocalyptic number.
It is an amenable number.
10001021102249 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001021102249 is an equidigital number, since it uses as much as digits as its factorization.
10001021102249 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 23.
The spelling of 10001021102249 in words is "ten trillion, one billion, twenty-one million, one hundred two thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •