Base | Representation |
---|---|
bin | 100111000000101001011… |
… | …100101001011100110001 |
3 | 100111021111102102100100201 |
4 | 213000221130221130301 |
5 | 322410141232441434 |
6 | 5411304414315201 |
7 | 364451415155452 |
oct | 47005134513461 |
9 | 10437442370321 |
10 | 2680754968369 |
11 | 9439a1324365 |
12 | 37366b4b8b01 |
13 | 165a4287071a |
14 | 93a6bc75129 |
15 | 49aec748614 |
hex | 27029729731 |
2680754968369 has 2 divisors, whose sum is σ = 2680754968370. Its totient is φ = 2680754968368.
The previous prime is 2680754968319. The next prime is 2680754968399. The reversal of 2680754968369 is 9638694570862.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2327800158369 + 352954810000 = 1525713^2 + 594100^2 .
It is a cyclic number.
It is not a de Polignac number, because 2680754968369 - 211 = 2680754966321 is a prime.
It is a super-2 number, since 2×26807549683692 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2680754968319) 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, 1340377484184 + 1340377484185.
It is an arithmetic number, because the mean of its divisors is an integer number (1340377484185).
Almost surely, 22680754968369 is an apocalyptic number.
It is an amenable number.
2680754968369 is a deficient number, since it is larger than the sum of its proper divisors (1).
2680754968369 is an equidigital number, since it uses as much as digits as its factorization.
2680754968369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 940584960, while the sum is 73.
The spelling of 2680754968369 in words is "two trillion, six hundred eighty billion, seven hundred fifty-four million, nine hundred sixty-eight thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •