Base | Representation |
---|---|
bin | 10100011111110011… |
… | …10001001100001001 |
3 | 1001101220101022012222 |
4 | 22033321301030021 |
5 | 140014040021134 |
6 | 5015534343425 |
7 | 536460220355 |
oct | 121771611411 |
9 | 31356338188 |
10 | 11004220169 |
11 | 4737660538 |
12 | 217135ab75 |
13 | 1064a744a7 |
14 | 76568c465 |
15 | 446124a2e |
hex | 28fe71309 |
11004220169 has 2 divisors, whose sum is σ = 11004220170. Its totient is φ = 11004220168.
The previous prime is 11004220163. The next prime is 11004220187. The reversal of 11004220169 is 96102240011.
11004220169 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5988747769 + 5015472400 = 77387^2 + 70820^2 .
It is a cyclic number.
It is not a de Polignac number, because 11004220169 - 228 = 10735784713 is a prime.
It is a super-2 number, since 2×110042201692 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11004220163) 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, 5502110084 + 5502110085.
It is an arithmetic number, because the mean of its divisors is an integer number (5502110085).
Almost surely, 211004220169 is an apocalyptic number.
It is an amenable number.
11004220169 is a deficient number, since it is larger than the sum of its proper divisors (1).
11004220169 is an equidigital number, since it uses as much as digits as its factorization.
11004220169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 26.
The spelling of 11004220169 in words is "eleven billion, four million, two hundred twenty thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •