Base | Representation |
---|---|
bin | 100110110111001111100… |
… | …100010011011010001101 |
3 | 100110022102200111001000111 |
4 | 212313033210103122031 |
5 | 322224001203404323 |
6 | 5402514414000021 |
7 | 363643241502406 |
oct | 46671744233215 |
9 | 10408380431014 |
10 | 2670657091213 |
11 | 93a68a338841 |
12 | 3717117a6011 |
13 | 164ac3803a97 |
14 | 93390b149ad |
15 | 4970aea4c0d |
hex | 26dcf91368d |
2670657091213 has 2 divisors, whose sum is σ = 2670657091214. Its totient is φ = 2670657091212.
The previous prime is 2670657091189. The next prime is 2670657091259. The reversal of 2670657091213 is 3121907560762.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2670210910084 + 446181129 = 1634078^2 + 21123^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2670657091213 is a prime.
It is a super-2 number, since 2×26706570912132 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2670657091283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1335328545606 + 1335328545607.
It is an arithmetic number, because the mean of its divisors is an integer number (1335328545607).
Almost surely, 22670657091213 is an apocalyptic number.
It is an amenable number.
2670657091213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2670657091213 is an equidigital number, since it uses as much as digits as its factorization.
2670657091213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 952560, while the sum is 49.
The spelling of 2670657091213 in words is "two trillion, six hundred seventy billion, six hundred fifty-seven million, ninety-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •