Base | Representation |
---|---|
bin | 1010000110001011101011… |
… | …1001011110110000010011 |
3 | 1110022021110212001002100002 |
4 | 2201202322321132300103 |
5 | 2423341011231420334 |
6 | 35335514153120215 |
7 | 2224021222416461 |
oct | 241427271366023 |
9 | 43267425032302 |
10 | 11101331123219 |
11 | 35a005900a647 |
12 | 12b36193b906b |
13 | 626b0a947a6c |
14 | 2a54432d9831 |
15 | 143b876d0b7e |
hex | a18bae5ec13 |
11101331123219 has 2 divisors, whose sum is σ = 11101331123220. Its totient is φ = 11101331123218.
The previous prime is 11101331123209. The next prime is 11101331123243. The reversal of 11101331123219 is 91232113310111.
11101331123219 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 is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11101331123219 is a prime.
It is a super-2 number, since 2×111013311232192 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 11101331123191 and 11101331123200.
It is not a weakly prime, because it can be changed into another prime (11101331123209) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550665561609 + 5550665561610.
It is an arithmetic number, because the mean of its divisors is an integer number (5550665561610).
Almost surely, 211101331123219 is an apocalyptic number.
11101331123219 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101331123219 is an equidigital number, since it uses as much as digits as its factorization.
11101331123219 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 29.
The spelling of 11101331123219 in words is "eleven trillion, one hundred one billion, three hundred thirty-one million, one hundred twenty-three thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •