Base | Representation |
---|---|
bin | 1100001010100000011000… |
… | …10010010110100001011001 |
3 | 10111201012112002111120000102 |
4 | 12011100030102112201121 |
5 | 12001224442142110141 |
6 | 132520235211545145 |
7 | 5430366442235024 |
oct | 605201422264131 |
9 | 114635462446012 |
10 | 26749262456921 |
11 | 858333133a0a4 |
12 | 3000229a5b1b5 |
13 | 11c05a1ac7954 |
14 | 686957b341bb |
15 | 315c22b2e99b |
hex | 18540c496859 |
26749262456921 has 2 divisors, whose sum is σ = 26749262456922. Its totient is φ = 26749262456920.
The previous prime is 26749262456869. The next prime is 26749262456923. The reversal of 26749262456921 is 12965426294762.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25343532103696 + 1405730353225 = 5034236^2 + 1185635^2 .
It is a cyclic number.
It is not a de Polignac number, because 26749262456921 - 218 = 26749262194777 is a prime.
Together with 26749262456923, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (26749262456923) 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, 13374631228460 + 13374631228461.
It is an arithmetic number, because the mean of its divisors is an integer number (13374631228461).
Almost surely, 226749262456921 is an apocalyptic number.
It is an amenable number.
26749262456921 is a deficient number, since it is larger than the sum of its proper divisors (1).
26749262456921 is an equidigital number, since it uses as much as digits as its factorization.
26749262456921 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 156764160, while the sum is 65.
The spelling of 26749262456921 in words is "twenty-six trillion, seven hundred forty-nine billion, two hundred sixty-two million, four hundred fifty-six thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •