Base | Representation |
---|---|
bin | 1010001000101011011001… |
… | …0001001011000111110001 |
3 | 1110110101010200021020022211 |
4 | 2202022312101023013301 |
5 | 2430041311444334022 |
6 | 35411324244532121 |
7 | 2230066512403162 |
oct | 242126621130761 |
9 | 43411120236284 |
10 | 11144203121137 |
11 | 3607259151189 |
12 | 12bb9a30b1041 |
13 | 62ab80a15578 |
14 | 2a754d0ad769 |
15 | 144d463c4e77 |
hex | a22b644b1f1 |
11144203121137 has 2 divisors, whose sum is σ = 11144203121138. Its totient is φ = 11144203121136.
The previous prime is 11144203121119. The next prime is 11144203121171. The reversal of 11144203121137 is 73112130244111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10981827165456 + 162375955681 = 3313884^2 + 402959^2 .
It is a cyclic number.
It is not a de Polignac number, because 11144203121137 - 223 = 11144194732529 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11144203121099 and 11144203121108.
It is not a weakly prime, because it can be changed into another prime (11144203121237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5572101560568 + 5572101560569.
It is an arithmetic number, because the mean of its divisors is an integer number (5572101560569).
Almost surely, 211144203121137 is an apocalyptic number.
It is an amenable number.
11144203121137 is a deficient number, since it is larger than the sum of its proper divisors (1).
11144203121137 is an equidigital number, since it uses as much as digits as its factorization.
11144203121137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4032, while the sum is 31.
Adding to 11144203121137 its reverse (73112130244111), we get a palindrome (84256333365248).
The spelling of 11144203121137 in words is "eleven trillion, one hundred forty-four billion, two hundred three million, one hundred twenty-one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •