Base | Representation |
---|---|
bin | 11000010011001001… |
… | …111001101110111001 |
3 | 2111100100010121001112 |
4 | 120103021321232321 |
5 | 411413314313044 |
6 | 15553000130105 |
7 | 1612364154152 |
oct | 302311715671 |
9 | 74310117045 |
10 | 26091166649 |
11 | 10079868749 |
12 | 5081a66935 |
13 | 25ca613662 |
14 | 1397266929 |
15 | a2a8b109e |
hex | 613279bb9 |
26091166649 has 8 divisors (see below), whose sum is σ = 26291190600. Its totient is φ = 25891475200.
The previous prime is 26091166601. The next prime is 26091166663. The reversal of 26091166649 is 94666119062.
It can be written as a sum of positive squares in 4 ways, for example, as 5401221049 + 20689945600 = 73493^2 + 143840^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 26091166649 - 220 = 26090118073 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 26091166597 and 26091166606.
It is not an unprimeable number, because it can be changed into a prime (26091166669) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 75569 + ... + 240609.
It is an arithmetic number, because the mean of its divisors is an integer number (3286398825).
Almost surely, 226091166649 is an apocalyptic number.
It is an amenable number.
26091166649 is a deficient number, since it is larger than the sum of its proper divisors (200023951).
26091166649 is a wasteful number, since it uses less digits than its factorization.
26091166649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166251.
The product of its (nonzero) digits is 839808, while the sum is 50.
The spelling of 26091166649 in words is "twenty-six billion, ninety-one million, one hundred sixty-six thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •