Base | Representation |
---|---|
bin | 100000110110010… |
… | …0100000100010101 |
3 | 2211210222121200022 |
4 | 1001230210010111 |
5 | 4224130413414 |
6 | 301211554525 |
7 | 36212361212 |
oct | 10154440425 |
9 | 2753877608 |
10 | 1102201109 |
11 | 516189009 |
12 | 26915ba45 |
13 | 147471809 |
14 | a6552b09 |
15 | 66b6d18e |
hex | 41b24115 |
1102201109 has 2 divisors, whose sum is σ = 1102201110. Its totient is φ = 1102201108.
The previous prime is 1102201099. The next prime is 1102201117. The reversal of 1102201109 is 9011022011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 706390084 + 395811025 = 26578^2 + 19895^2 .
It is an emirp because it is prime and its reverse (9011022011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1102201109 - 224 = 1085423893 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1102201909) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551100554 + 551100555.
It is an arithmetic number, because the mean of its divisors is an integer number (551100555).
Almost surely, 21102201109 is an apocalyptic number.
It is an amenable number.
1102201109 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102201109 is an equidigital number, since it uses as much as digits as its factorization.
1102201109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 17.
The square root of 1102201109 is about 33199.4142870021. The cubic root of 1102201109 is about 1032.9681903647.
The spelling of 1102201109 in words is "one billion, one hundred two million, two hundred one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •