Base | Representation |
---|---|
bin | 100110010001010010100… |
… | …010011011110000101101 |
3 | 100022102020120202021102202 |
4 | 212101102202123300231 |
5 | 321042021103242334 |
6 | 5332054521431245 |
7 | 361001330324063 |
oct | 46212242336055 |
9 | 10272216667382 |
10 | 2629904743469 |
11 | 924377736803 |
12 | 36583993b525 |
13 | 160cca914253 |
14 | 91406664033 |
15 | 4862340a17e |
hex | 2645289bc2d |
2629904743469 has 2 divisors, whose sum is σ = 2629904743470. Its totient is φ = 2629904743468.
The previous prime is 2629904743399. The next prime is 2629904743481. The reversal of 2629904743469 is 9643474099262.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2571901801225 + 58002942244 = 1603715^2 + 240838^2 .
It is a cyclic number.
It is not a de Polignac number, because 2629904743469 - 212 = 2629904739373 is a prime.
It is a super-2 number, since 2×26299047434692 (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 (2629904743769) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1314952371734 + 1314952371735.
It is an arithmetic number, because the mean of its divisors is an integer number (1314952371735).
Almost surely, 22629904743469 is an apocalyptic number.
It is an amenable number.
2629904743469 is a deficient number, since it is larger than the sum of its proper divisors (1).
2629904743469 is an equidigital number, since it uses as much as digits as its factorization.
2629904743469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 141087744, while the sum is 65.
The spelling of 2629904743469 in words is "two trillion, six hundred twenty-nine billion, nine hundred four million, seven hundred forty-three thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •