Base | Representation |
---|---|
bin | 1010001110010000110011… |
… | …0011011001100001110101 |
3 | 1110210112202222100201220111 |
4 | 2203210030303121201311 |
5 | 2433124303404323013 |
6 | 35523352335303021 |
7 | 2240034152262442 |
oct | 243441463314165 |
9 | 43715688321814 |
10 | 11240144214133 |
11 | 3643a1141938a |
12 | 13164b967aa71 |
13 | 636c30649c93 |
14 | 2ac0510449c9 |
15 | 1475ae10073d |
hex | a390ccd9875 |
11240144214133 has 2 divisors, whose sum is σ = 11240144214134. Its totient is φ = 11240144214132.
The previous prime is 11240144214109. The next prime is 11240144214163. The reversal of 11240144214133 is 33141244104211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11233175637649 + 6968576484 = 3351593^2 + 83478^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11240144214133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11240144214095 and 11240144214104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11240144214163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5620072107066 + 5620072107067.
It is an arithmetic number, because the mean of its divisors is an integer number (5620072107067).
Almost surely, 211240144214133 is an apocalyptic number.
It is an amenable number.
11240144214133 is a deficient number, since it is larger than the sum of its proper divisors (1).
11240144214133 is an equidigital number, since it uses as much as digits as its factorization.
11240144214133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 31.
Adding to 11240144214133 its reverse (33141244104211), we get a palindrome (44381388318344).
The spelling of 11240144214133 in words is "eleven trillion, two hundred forty billion, one hundred forty-four million, two hundred fourteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •