Base | Representation |
---|---|
bin | 1010011001111001110001… |
… | …0100000001011001001011 |
3 | 1111111122221122211201101202 |
4 | 2212132130110001121023 |
5 | 2444413331310403111 |
6 | 40155304015134415 |
7 | 2260343563660001 |
oct | 246363424013113 |
9 | 44448848751352 |
10 | 11440120403531 |
11 | 37108007a72a6 |
12 | 134920921440b |
13 | 64ca4ca50431 |
14 | 2b79c1cc8a71 |
15 | 14c8b541eb3b |
hex | a679c50164b |
11440120403531 has 2 divisors, whose sum is σ = 11440120403532. Its totient is φ = 11440120403530.
The previous prime is 11440120403473. The next prime is 11440120403533. The reversal of 11440120403531 is 13530402104411.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11440120403531 is a prime.
It is a super-2 number, since 2×114401204035312 (a number of 27 digits) contains 22 as substring.
Together with 11440120403533, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 11440120403494 and 11440120403503.
It is not a weakly prime, because it can be changed into another prime (11440120403533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5720060201765 + 5720060201766.
It is an arithmetic number, because the mean of its divisors is an integer number (5720060201766).
Almost surely, 211440120403531 is an apocalyptic number.
11440120403531 is a deficient number, since it is larger than the sum of its proper divisors (1).
11440120403531 is an equidigital number, since it uses as much as digits as its factorization.
11440120403531 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 11440120403531 its reverse (13530402104411), we get a palindrome (24970522507942).
The spelling of 11440120403531 in words is "eleven trillion, four hundred forty billion, one hundred twenty million, four hundred three thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •