Base | Representation |
---|---|
bin | 100000110101111… |
… | …0111111001001001 |
3 | 2211210122102110211 |
4 | 1001223313321021 |
5 | 4224104121134 |
6 | 301204041121 |
7 | 36211005535 |
oct | 10153677111 |
9 | 2753572424 |
10 | 1102020169 |
11 | 516075078 |
12 | 2690931a1 |
13 | 14740a353 |
14 | a6506bc5 |
15 | 66b34764 |
hex | 41af7e49 |
1102020169 has 2 divisors, whose sum is σ = 1102020170. Its totient is φ = 1102020168.
The previous prime is 1102020151. The next prime is 1102020187. The reversal of 1102020169 is 9610202011.
It is a balanced prime because it is at equal distance from previous prime (1102020151) and next prime (1102020187).
It can be written as a sum of positive squares in only one way, i.e., 850480569 + 251539600 = 29163^2 + 15860^2 .
It is a cyclic number.
It is not a de Polignac number, because 1102020169 - 27 = 1102020041 is a prime.
It is a super-2 number, since 2×11020201692 = 2428896905765577122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1102020109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551010084 + 551010085.
It is an arithmetic number, because the mean of its divisors is an integer number (551010085).
Almost surely, 21102020169 is an apocalyptic number.
It is an amenable number.
1102020169 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102020169 is an equidigital number, since it uses as much as digits as its factorization.
1102020169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 22.
The square root of 1102020169 is about 33196.6891270801. The cubic root of 1102020169 is about 1032.9116624191.
The spelling of 1102020169 in words is "one billion, one hundred two million, twenty thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •