Base | Representation |
---|---|
bin | 100110110001100001100… |
… | …011010010000100100011 |
3 | 100102201120201121200212212 |
4 | 212301201203102010203 |
5 | 322123412142100111 |
6 | 5400021212512335 |
7 | 363335125250342 |
oct | 46614143220443 |
9 | 10381521550785 |
10 | 2664516362531 |
11 | 938019028461 |
12 | 37049917b6ab |
13 | 16435553410a |
14 | 92d6b351b59 |
15 | 4949bd1e98b |
hex | 26c618d2123 |
2664516362531 has 2 divisors, whose sum is σ = 2664516362532. Its totient is φ = 2664516362530.
The previous prime is 2664516362507. The next prime is 2664516362533. The reversal of 2664516362531 is 1352636154662.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2664516362531 - 238 = 2389638455587 is a prime.
It is a super-2 number, since 2×26645163625312 (a number of 26 digits) contains 22 as substring.
Together with 2664516362533, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2664516362531.
It is not a weakly prime, because it can be changed into another prime (2664516362533) 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, 1332258181265 + 1332258181266.
It is an arithmetic number, because the mean of its divisors is an integer number (1332258181266).
Almost surely, 22664516362531 is an apocalyptic number.
2664516362531 is a deficient number, since it is larger than the sum of its proper divisors (1).
2664516362531 is an equidigital number, since it uses as much as digits as its factorization.
2664516362531 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4665600, while the sum is 50.
The spelling of 2664516362531 in words is "two trillion, six hundred sixty-four billion, five hundred sixteen million, three hundred sixty-two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •