Base | Representation |
---|---|
bin | 100000101100110… |
… | …0101101100000101 |
3 | 2211110121220111112 |
4 | 1001121211230011 |
5 | 4221342231023 |
6 | 300513214405 |
7 | 36122163401 |
oct | 10131455405 |
9 | 2743556445 |
10 | 1097227013 |
11 | 5133a0993 |
12 | 267561405 |
13 | 14641c76c |
14 | a5a1a101 |
15 | 664d9478 |
hex | 41665b05 |
1097227013 has 2 divisors, whose sum is σ = 1097227014. Its totient is φ = 1097227012.
The previous prime is 1097227009. The next prime is 1097227031. The reversal of 1097227013 is 3107227901.
Together with next prime (1097227031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 548636929 + 548590084 = 23423^2 + 23422^2 .
It is a cyclic number.
It is not a de Polignac number, because 1097227013 - 22 = 1097227009 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1097227003) 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, 548613506 + 548613507.
It is an arithmetic number, because the mean of its divisors is an integer number (548613507).
Almost surely, 21097227013 is an apocalyptic number.
1097227013 is the 23423-rd centered square number.
It is an amenable number.
1097227013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1097227013 is an equidigital number, since it uses as much as digits as its factorization.
1097227013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5292, while the sum is 32.
The square root of 1097227013 is about 33124.4171722311. The cubic root of 1097227013 is about 1031.4119614956.
The spelling of 1097227013 in words is "one billion, ninety-seven million, two hundred twenty-seven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •