Base | Representation |
---|---|
bin | 11000010001110100… |
… | …000101000010001101 |
3 | 2111021202210120110212 |
4 | 120101310011002031 |
5 | 411342034343212 |
6 | 15550434012205 |
7 | 1612002012101 |
oct | 302164050215 |
9 | 74252716425 |
10 | 26068668557 |
11 | 100680a1588 |
12 | 5076417065 |
13 | 25c5a67189 |
14 | 139428b901 |
15 | a28919e22 |
hex | 611d0508d |
26068668557 has 4 divisors (see below), whose sum is σ = 26185568640. Its totient is φ = 25951768476.
The previous prime is 26068668551. The next prime is 26068668641. The reversal of 26068668557 is 75586686062.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-26068668557 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 26068668496 and 26068668505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26068668551) 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 in 3 ways as a sum of consecutive naturals, for example, 58449707 + ... + 58450152.
It is an arithmetic number, because the mean of its divisors is an integer number (6546392160).
Almost surely, 226068668557 is an apocalyptic number.
It is an amenable number.
26068668557 is a deficient number, since it is larger than the sum of its proper divisors (116900083).
26068668557 is a wasteful number, since it uses less digits than its factorization.
26068668557 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116900082.
The product of its (nonzero) digits is 29030400, while the sum is 59.
The spelling of 26068668557 in words is "twenty-six billion, sixty-eight million, six hundred sixty-eight thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •