Base | Representation |
---|---|
bin | 11111001001001001010… |
… | …110110010000001000101 |
3 | 21120121000221200000220101 |
4 | 133021021112302001011 |
5 | 240030433323002323 |
6 | 4315054245404101 |
7 | 310422164304241 |
oct | 37111126620105 |
9 | 7517027600811 |
10 | 2140124422213 |
11 | 7556924971a8 |
12 | 2a692b409631 |
13 | 126a74b3b07b |
14 | 75822829421 |
15 | 3aa09ac9dad |
hex | 1f2495b2045 |
2140124422213 has 2 divisors, whose sum is σ = 2140124422214. Its totient is φ = 2140124422212.
The previous prime is 2140124422153. The next prime is 2140124422231. The reversal of 2140124422213 is 3122244210412.
Together with next prime (2140124422231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2048155975044 + 91968447169 = 1431138^2 + 303263^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2140124422213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2140124422313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1070062211106 + 1070062211107.
It is an arithmetic number, because the mean of its divisors is an integer number (1070062211107).
Almost surely, 22140124422213 is an apocalyptic number.
It is an amenable number.
2140124422213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2140124422213 is an equidigital number, since it uses as much as digits as its factorization.
2140124422213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6144, while the sum is 28.
Adding to 2140124422213 its reverse (3122244210412), we get a palindrome (5262368632625).
The spelling of 2140124422213 in words is "two trillion, one hundred forty billion, one hundred twenty-four million, four hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •