Base | Representation |
---|---|
bin | 100110011100110111111… |
… | …110101111100000111101 |
3 | 100100121100111120010012222 |
4 | 212130313332233200331 |
5 | 321243010041101334 |
6 | 5341513123535125 |
7 | 361621515052451 |
oct | 46346776574075 |
9 | 10317314503188 |
10 | 2642344081469 |
11 | 929680391534 |
12 | 36812b82a4a5 |
13 | 162230ab1791 |
14 | 91c66766661 |
15 | 48b0050ed2e |
hex | 26737faf83d |
2642344081469 has 2 divisors, whose sum is σ = 2642344081470. Its totient is φ = 2642344081468.
The previous prime is 2642344081439. The next prime is 2642344081493. The reversal of 2642344081469 is 9641804432462.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2366099233369 + 276244848100 = 1538213^2 + 525590^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2642344081469 is a prime.
It is a super-2 number, since 2×26423440814692 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2642344081469.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2642344081409) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1321172040734 + 1321172040735.
It is an arithmetic number, because the mean of its divisors is an integer number (1321172040735).
Almost surely, 22642344081469 is an apocalyptic number.
It is an amenable number.
2642344081469 is a deficient number, since it is larger than the sum of its proper divisors (1).
2642344081469 is an equidigital number, since it uses as much as digits as its factorization.
2642344081469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7962624, while the sum is 53.
The spelling of 2642344081469 in words is "two trillion, six hundred forty-two billion, three hundred forty-four million, eighty-one thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •