Base | Representation |
---|---|
bin | 1010000010110110000110… |
… | …1110001010111010101101 |
3 | 1110002210111101012011110201 |
4 | 2200231201232022322231 |
5 | 2421421103101130214 |
6 | 35253313241033501 |
7 | 2216621424413005 |
oct | 240554156127255 |
9 | 43083441164421 |
10 | 11044000411309 |
11 | 35788093521a8 |
12 | 12a4499485891 |
13 | 6215a22102a8 |
14 | 2a2765163005 |
15 | 14242e498274 |
hex | a0b61b8aead |
11044000411309 has 2 divisors, whose sum is σ = 11044000411310. Its totient is φ = 11044000411308.
The previous prime is 11044000411267. The next prime is 11044000411333. The reversal of 11044000411309 is 90311400044011.
11044000411309 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10772981257284 + 271019154025 = 3282222^2 + 520595^2 .
It is a cyclic number.
It is not a de Polignac number, because 11044000411309 - 27 = 11044000411181 is a prime.
It is a super-2 number, since 2×110440004113092 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11044000411349) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5522000205654 + 5522000205655.
It is an arithmetic number, because the mean of its divisors is an integer number (5522000205655).
Almost surely, 211044000411309 is an apocalyptic number.
It is an amenable number.
11044000411309 is a deficient number, since it is larger than the sum of its proper divisors (1).
11044000411309 is an equidigital number, since it uses as much as digits as its factorization.
11044000411309 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 28.
The spelling of 11044000411309 in words is "eleven trillion, forty-four billion, four hundred eleven thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •