Base | Representation |
---|---|
bin | 100000010111110… |
… | …0111101011001001 |
3 | 2210200220221201011 |
4 | 1000233213223021 |
5 | 4211033200342 |
6 | 255441323521 |
7 | 35626522006 |
oct | 10057475311 |
9 | 2720827634 |
10 | 1086225097 |
11 | 508166aa1 |
12 | 2639365a1 |
13 | 144069b59 |
14 | a43948ad |
15 | 65564717 |
hex | 40be7ac9 |
1086225097 has 2 divisors, whose sum is σ = 1086225098. Its totient is φ = 1086225096.
The previous prime is 1086225053. The next prime is 1086225137. The reversal of 1086225097 is 7905226801.
It is an a-pointer prime, because the next prime (1086225137) can be obtained adding 1086225097 to its sum of digits (40).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 932935936 + 153289161 = 30544^2 + 12381^2 .
It is an emirp because it is prime and its reverse (7905226801) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1086225097 - 215 = 1086192329 is a prime.
It is a super-2 number, since 2×10862250972 = 2359769922705318818, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1086225017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 543112548 + 543112549.
It is an arithmetic number, because the mean of its divisors is an integer number (543112549).
Almost surely, 21086225097 is an apocalyptic number.
It is an amenable number.
1086225097 is a deficient number, since it is larger than the sum of its proper divisors (1).
1086225097 is an equidigital number, since it uses as much as digits as its factorization.
1086225097 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 60480, while the sum is 40.
The square root of 1086225097 is about 32957.9291976908. The cubic root of 1086225097 is about 1027.9530456557.
The spelling of 1086225097 in words is "one billion, eighty-six million, two hundred twenty-five thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •