Base | Representation |
---|---|
bin | 100000110110100… |
… | …0110010001011001 |
3 | 2211211020201212012 |
4 | 1001231012101121 |
5 | 4224144404314 |
6 | 301214555305 |
7 | 36213513524 |
oct | 10155062131 |
9 | 2754221765 |
10 | 1102341209 |
11 | 5162742a2 |
12 | 269208b35 |
13 | 1474c0508 |
14 | a658bbbb |
15 | 66b9993e |
hex | 41b46459 |
1102341209 has 2 divisors, whose sum is σ = 1102341210. Its totient is φ = 1102341208.
The previous prime is 1102341179. The next prime is 1102341239. The reversal of 1102341209 is 9021432011.
It is a balanced prime because it is at equal distance from previous prime (1102341179) and next prime (1102341239).
It can be written as a sum of positive squares in only one way, i.e., 953574400 + 148766809 = 30880^2 + 12197^2 .
It is a cyclic number.
It is not a de Polignac number, because 1102341209 - 212 = 1102337113 is a prime.
It is a super-2 number, since 2×11023412092 = 2430312282119163362, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1102341239) 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, 551170604 + 551170605.
It is an arithmetic number, because the mean of its divisors is an integer number (551170605).
Almost surely, 21102341209 is an apocalyptic number.
It is an amenable number.
1102341209 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102341209 is an equidigital number, since it uses as much as digits as its factorization.
1102341209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 23.
The square root of 1102341209 is about 33201.5241969401. The cubic root of 1102341209 is about 1033.0119551281.
The spelling of 1102341209 in words is "one billion, one hundred two million, three hundred forty-one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •