Base | Representation |
---|---|
bin | 1010000001011101001001… |
… | …1001011110111111111001 |
3 | 1110000111212011212220022021 |
4 | 2200113102121132333321 |
5 | 2421023201434311134 |
6 | 35234323530354441 |
7 | 2215114605016465 |
oct | 240272231367771 |
9 | 43014764786267 |
10 | 11020121010169 |
11 | 356967501a737 |
12 | 129b93428ba21 |
13 | 61c267bba62b |
14 | 2a153b95b4a5 |
15 | 1419d2d7a0b4 |
hex | a05d265eff9 |
11020121010169 has 2 divisors, whose sum is σ = 11020121010170. Its totient is φ = 11020121010168.
The previous prime is 11020121010109. The next prime is 11020121010179. The reversal of 11020121010169 is 96101012102011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7664952159225 + 3355168850944 = 2768565^2 + 1831712^2 .
It is a cyclic number.
It is not a de Polignac number, because 11020121010169 - 211 = 11020121008121 is a prime.
It is a super-2 number, since 2×110201210101692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11020121010109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510060505084 + 5510060505085.
It is an arithmetic number, because the mean of its divisors is an integer number (5510060505085).
Almost surely, 211020121010169 is an apocalyptic number.
It is an amenable number.
11020121010169 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020121010169 is an equidigital number, since it uses as much as digits as its factorization.
11020121010169 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 25.
The spelling of 11020121010169 in words is "eleven trillion, twenty billion, one hundred twenty-one million, ten thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •