Base | Representation |
---|---|
bin | 100000100110100011000… |
… | …010100100010001110111 |
3 | 21221011220020220220211122 |
4 | 200212203002210101313 |
5 | 243201331302222221 |
6 | 4433122012454155 |
7 | 320602350003245 |
oct | 40464302442167 |
9 | 7834806826748 |
10 | 2240413320311 |
11 | 794176a03761 |
12 | 302259a7a35b |
13 | 13336845c31a |
14 | 7a617dad795 |
15 | 3d42937deab |
hex | 209a30a4477 |
2240413320311 has 2 divisors, whose sum is σ = 2240413320312. Its totient is φ = 2240413320310.
The previous prime is 2240413320307. The next prime is 2240413320337. The reversal of 2240413320311 is 1130233140422.
It is an a-pointer prime, because the next prime (2240413320337) can be obtained adding 2240413320311 to its sum of digits (26).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2240413320311 - 22 = 2240413320307 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2240413380311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1120206660155 + 1120206660156.
It is an arithmetic number, because the mean of its divisors is an integer number (1120206660156).
Almost surely, 22240413320311 is an apocalyptic number.
2240413320311 is a deficient number, since it is larger than the sum of its proper divisors (1).
2240413320311 is an equidigital number, since it uses as much as digits as its factorization.
2240413320311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 2240413320311 its reverse (1130233140422), we get a palindrome (3370646460733).
The spelling of 2240413320311 in words is "two trillion, two hundred forty billion, four hundred thirteen million, three hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •