Base | Representation |
---|---|
bin | 1100001000000010101100… |
… | …10000000011110011000001 |
3 | 10111102010000002201120101212 |
4 | 12010001112100003303001 |
5 | 11443333102112232001 |
6 | 132413314443535505 |
7 | 5421311513361236 |
oct | 604012620036301 |
9 | 114363002646355 |
10 | 26664604024001 |
11 | 8550438910459 |
12 | 2ba7941b2a595 |
13 | 11b55cc826c68 |
14 | 68280640b78d |
15 | 31391a6c97bb |
hex | 184056403cc1 |
26664604024001 has 2 divisors, whose sum is σ = 26664604024002. Its totient is φ = 26664604024000.
The previous prime is 26664604023947. The next prime is 26664604024013. The reversal of 26664604024001 is 10042040646662.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22358144833600 + 4306459190401 = 4728440^2 + 2075201^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-26664604024001 is a prime.
It is a super-2 number, since 2×266646040240012 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 26664604024001.
It is not a weakly prime, because it can be changed into another prime (26664604024081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13332302012000 + 13332302012001.
It is an arithmetic number, because the mean of its divisors is an integer number (13332302012001).
Almost surely, 226664604024001 is an apocalyptic number.
It is an amenable number.
26664604024001 is a deficient number, since it is larger than the sum of its proper divisors (1).
26664604024001 is an equidigital number, since it uses as much as digits as its factorization.
26664604024001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 331776, while the sum is 41.
The spelling of 26664604024001 in words is "twenty-six trillion, six hundred sixty-four billion, six hundred four million, twenty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •