Base | Representation |
---|---|
bin | 1100000100100010000100… |
… | …00000010000110110100001 |
3 | 10110222120201100212022122111 |
4 | 12002101002000100312201 |
5 | 11434344110321121221 |
6 | 132242051521435321 |
7 | 5406512123633314 |
oct | 602210200206641 |
9 | 113876640768574 |
10 | 26544005254561 |
11 | 8504281a68a63 |
12 | 2b884a579bb41 |
13 | 11a7120585162 |
14 | 67aa4575c97b |
15 | 31070cd9abe1 |
hex | 182442010da1 |
26544005254561 has 2 divisors, whose sum is σ = 26544005254562. Its totient is φ = 26544005254560.
The previous prime is 26544005254477. The next prime is 26544005254607. The reversal of 26544005254561 is 16545250044562.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 24938637699600 + 1605367554961 = 4993860^2 + 1267031^2 .
It is a cyclic number.
It is not a de Polignac number, because 26544005254561 - 29 = 26544005254049 is a prime.
It is a super-2 number, since 2×265440052545612 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (26544005252561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13272002627280 + 13272002627281.
It is an arithmetic number, because the mean of its divisors is an integer number (13272002627281).
Almost surely, 226544005254561 is an apocalyptic number.
It is an amenable number.
26544005254561 is a deficient number, since it is larger than the sum of its proper divisors (1).
26544005254561 is an equidigital number, since it uses as much as digits as its factorization.
26544005254561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760000, while the sum is 49.
The spelling of 26544005254561 in words is "twenty-six trillion, five hundred forty-four billion, five million, two hundred fifty-four thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •