Base | Representation |
---|---|
bin | 10000000010100000101… |
… | …110010001110110010101 |
3 | 10220100222210000120210022 |
4 | 100002200232101312111 |
5 | 121024310234122234 |
6 | 2202203013034525 |
7 | 142426513246616 |
oct | 20024056216625 |
9 | 3810883016708 |
10 | 1102208114069 |
11 | 395497822857 |
12 | 159747325a45 |
13 | 7cc263bac4a |
14 | 3b4c0857c0d |
15 | 1da0e771e2e |
hex | 100a0b91d95 |
1102208114069 has 2 divisors, whose sum is σ = 1102208114070. Its totient is φ = 1102208114068.
The previous prime is 1102208114023. The next prime is 1102208114101. The reversal of 1102208114069 is 9604118022011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1047153123025 + 55054991044 = 1023305^2 + 234638^2 .
It is an emirp because it is prime and its reverse (9604118022011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1102208114069 - 212 = 1102208109973 is a prime.
It is a super-2 number, since 2×11022081140692 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1102208114369) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551104057034 + 551104057035.
It is an arithmetic number, because the mean of its divisors is an integer number (551104057035).
Almost surely, 21102208114069 is an apocalyptic number.
It is an amenable number.
1102208114069 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102208114069 is an equidigital number, since it uses as much as digits as its factorization.
1102208114069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6912, while the sum is 35.
The spelling of 1102208114069 in words is "one trillion, one hundred two billion, two hundred eight million, one hundred fourteen thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •