Base | Representation |
---|---|
bin | 1100000100011110100001… |
… | …00010110000100001011001 |
3 | 10110222101210200222110012222 |
4 | 12002033100202300201121 |
5 | 11434331211013211203 |
6 | 132241135001513425 |
7 | 5406414010635554 |
oct | 602172042604131 |
9 | 113871720873188 |
10 | 26542101694553 |
11 | 8503495501175 |
12 | 2b880541a2875 |
13 | 11a6ba90a60a3 |
14 | 67a904a0969b |
15 | 31064abd8038 |
hex | 1823d08b0859 |
26542101694553 has 2 divisors, whose sum is σ = 26542101694554. Its totient is φ = 26542101694552.
The previous prime is 26542101694547. The next prime is 26542101694579. The reversal of 26542101694553 is 35549610124562.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 25998087764224 + 544013930329 = 5098832^2 + 737573^2 .
It is a cyclic number.
It is not a de Polignac number, because 26542101694553 - 26 = 26542101694489 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 26542101694495 and 26542101694504.
It is not a weakly prime, because it can be changed into another prime (26542101690553) 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, 13271050847276 + 13271050847277.
It is an arithmetic number, because the mean of its divisors is an integer number (13271050847277).
Almost surely, 226542101694553 is an apocalyptic number.
It is an amenable number.
26542101694553 is a deficient number, since it is larger than the sum of its proper divisors (1).
26542101694553 is an equidigital number, since it uses as much as digits as its factorization.
26542101694553 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776000, while the sum is 53.
The spelling of 26542101694553 in words is "twenty-six trillion, five hundred forty-two billion, one hundred one million, six hundred ninety-four thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •