Base | Representation |
---|---|
bin | 11000100110110010… |
… | …101111101111011111 |
3 | 2112012022002121112110 |
4 | 120212302233233133 |
5 | 413102141000420 |
6 | 20045410005103 |
7 | 1623504512046 |
oct | 304662575737 |
9 | 75168077473 |
10 | 26420640735 |
11 | 10228843485 |
12 | 5154276793 |
13 | 2650960c38 |
14 | 13c8d0d55d |
15 | a49792ee0 |
hex | 626cafbdf |
26420640735 has 8 divisors (see below), whose sum is σ = 42273025200. Its totient is φ = 14091008384.
The previous prime is 26420640731. The next prime is 26420640739. The reversal of 26420640735 is 53704602462.
It is an interprime number because it is at equal distance from previous prime (26420640731) and next prime (26420640739).
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 26420640735 - 22 = 26420640731 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 26420640693 and 26420640702.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26420640731) 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 7 ways as a sum of consecutive naturals, for example, 880688010 + ... + 880688039.
It is an arithmetic number, because the mean of its divisors is an integer number (5284128150).
Almost surely, 226420640735 is an apocalyptic number.
26420640735 is a deficient number, since it is larger than the sum of its proper divisors (15852384465).
26420640735 is a wasteful number, since it uses less digits than its factorization.
26420640735 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1761376057.
The product of its (nonzero) digits is 241920, while the sum is 39.
The spelling of 26420640735 in words is "twenty-six billion, four hundred twenty million, six hundred forty thousand, seven hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •