Base | Representation |
---|---|
bin | 1101000000011… |
… | …10000000001101 |
3 | 21121022022202202 |
4 | 12200032000031 |
5 | 210412444021 |
6 | 14454331245 |
7 | 2463261542 |
oct | 640160015 |
9 | 247268682 |
10 | 109109261 |
11 | 56653448 |
12 | 30659b25 |
13 | 197b2ac1 |
14 | 106c2bc9 |
15 | 98a3a0b |
hex | 680e00d |
109109261 has 2 divisors, whose sum is σ = 109109262. Its totient is φ = 109109260.
The previous prime is 109109257. The next prime is 109109279. The reversal of 109109261 is 162901901.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109098025 + 11236 = 10445^2 + 106^2 .
It is an emirp because it is prime and its reverse (162901901) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 109109261 - 22 = 109109257 is a prime.
It is a super-2 number, since 2×1091092612 = 23809661671932242, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (109109201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54554630 + 54554631.
It is an arithmetic number, because the mean of its divisors is an integer number (54554631).
Almost surely, 2109109261 is an apocalyptic number.
It is an amenable number.
109109261 is a deficient number, since it is larger than the sum of its proper divisors (1).
109109261 is an equidigital number, since it uses as much as digits as its factorization.
109109261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 29.
The square root of 109109261 is about 10445.5378511592. The cubic root of 109109261 is about 477.8451746139.
The spelling of 109109261 in words is "one hundred nine million, one hundred nine thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •