Base | Representation |
---|---|
bin | 100110011001000101000… |
… | …001111001000000110101 |
3 | 100100012211102202221000222 |
4 | 212121011001321000311 |
5 | 321211133104341232 |
6 | 5340000440144125 |
7 | 361415512233344 |
oct | 46310501710065 |
9 | 10305742687028 |
10 | 2638268043317 |
11 | 927979592765 |
12 | 367392768045 |
13 | 161a314b909a |
14 | 9199b29bb5b |
15 | 48962769d12 |
hex | 26645079035 |
2638268043317 has 2 divisors, whose sum is σ = 2638268043318. Its totient is φ = 2638268043316.
The previous prime is 2638268043293. The next prime is 2638268043319. The reversal of 2638268043317 is 7133408628362.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2272734138481 + 365533904836 = 1507559^2 + 604594^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2638268043317 is a prime.
Together with 2638268043319, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2638268043319) 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, 1319134021658 + 1319134021659.
It is an arithmetic number, because the mean of its divisors is an integer number (1319134021659).
Almost surely, 22638268043317 is an apocalyptic number.
It is an amenable number.
2638268043317 is a deficient number, since it is larger than the sum of its proper divisors (1).
2638268043317 is an equidigital number, since it uses as much as digits as its factorization.
2638268043317 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6967296, while the sum is 53.
The spelling of 2638268043317 in words is "two trillion, six hundred thirty-eight billion, two hundred sixty-eight million, forty-three thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •