Base | Representation |
---|---|
bin | 1010011000001110011111… |
… | …1000010011101111101011 |
3 | 1111101220121202021012100011 |
4 | 2212003213320103233223 |
5 | 2443430342244423021 |
6 | 40134142320152351 |
7 | 2255304142536322 |
oct | 246034770235753 |
9 | 44356552235304 |
10 | 11411323436011 |
11 | 36aa573650394 |
12 | 13437111686b7 |
13 | 64a1109a1b95 |
14 | 2b644d55d0b9 |
15 | 14bc7c22ede1 |
hex | a60e7e13beb |
11411323436011 has 2 divisors, whose sum is σ = 11411323436012. Its totient is φ = 11411323436010.
The previous prime is 11411323435931. The next prime is 11411323436017. The reversal of 11411323436011 is 11063432311411.
It is a strong prime.
It is an emirp because it is prime and its reverse (11063432311411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11411323436011 - 217 = 11411323304939 is a prime.
It is a super-2 number, since 2×114113234360112 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11411323436017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5705661718005 + 5705661718006.
It is an arithmetic number, because the mean of its divisors is an integer number (5705661718006).
Almost surely, 211411323436011 is an apocalyptic number.
11411323436011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11411323436011 is an equidigital number, since it uses as much as digits as its factorization.
11411323436011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 31.
Adding to 11411323436011 its reverse (11063432311411), we get a palindrome (22474755747422).
The spelling of 11411323436011 in words is "eleven trillion, four hundred eleven billion, three hundred twenty-three million, four hundred thirty-six thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •