Base | Representation |
---|---|
bin | 1100000100101101111011… |
… | …00011011010010101011100 |
3 | 10111000012011010221222220210 |
4 | 12002112331203122111130 |
5 | 11440000130444031213 |
6 | 132245023433212420 |
7 | 5410125665104035 |
oct | 602267543322534 |
9 | 114005133858823 |
10 | 26550373033308 |
11 | 8506a4a457423 |
12 | 2b89782261110 |
13 | 11a78c68c0487 |
14 | 67b08b345a8c |
15 | 310981e300c3 |
hex | 1825bd8da55c |
26550373033308 has 12 divisors (see below), whose sum is σ = 61950870411080. Its totient is φ = 8850124344432.
The previous prime is 26550373033307. The next prime is 26550373033309. The reversal of 26550373033308 is 80333037305562.
It is an interprime number because it is at equal distance from previous prime (26550373033307) and next prime (26550373033309).
It is a tau number, because it is divible by the number of its divisors (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26550373033307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1106265543043 + ... + 1106265543066.
Almost surely, 226550373033308 is an apocalyptic number.
It is an amenable number.
26550373033308 is an abundant number, since it is smaller than the sum of its proper divisors (35400497377772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26550373033308 is a wasteful number, since it uses less digits than its factorization.
26550373033308 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2212531086116 (or 2212531086114 counting only the distinct ones).
The product of its (nonzero) digits is 4082400, while the sum is 48.
The spelling of 26550373033308 in words is "twenty-six trillion, five hundred fifty billion, three hundred seventy-three million, thirty-three thousand, three hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •