Base | Representation |
---|---|
bin | 1010000000010110010100… |
… | …0100011011100001010001 |
3 | 1102221200210001111021202011 |
4 | 2200011211010123201101 |
5 | 2420220231331431134 |
6 | 35221501100222521 |
7 | 2213542453546153 |
oct | 240054504334121 |
9 | 42850701437664 |
10 | 11001106905169 |
11 | 35615a8060177 |
12 | 129810853aa41 |
13 | 61a527851a24 |
14 | 2a0656590ad3 |
15 | 14126d956264 |
hex | a016511b851 |
11001106905169 has 2 divisors, whose sum is σ = 11001106905170. Its totient is φ = 11001106905168.
The previous prime is 11001106905163. The next prime is 11001106905181. The reversal of 11001106905169 is 96150960110011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8708471824144 + 2292635081025 = 2951012^2 + 1514145^2 .
It is a cyclic number.
It is not a de Polignac number, because 11001106905169 - 29 = 11001106904657 is a prime.
It is a super-2 number, since 2×110011069051692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11001106905163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500553452584 + 5500553452585.
It is an arithmetic number, because the mean of its divisors is an integer number (5500553452585).
Almost surely, 211001106905169 is an apocalyptic number.
It is an amenable number.
11001106905169 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001106905169 is an equidigital number, since it uses as much as digits as its factorization.
11001106905169 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 14580, while the sum is 40.
The spelling of 11001106905169 in words is "eleven trillion, one billion, one hundred six million, nine hundred five thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •