Base | Representation |
---|---|
bin | 11000010010001001… |
… | …010101111010010101 |
3 | 2111022011021202202221 |
4 | 120102021111322111 |
5 | 411400001231314 |
6 | 15551153302341 |
7 | 1612100256214 |
oct | 302211257225 |
9 | 74264252687 |
10 | 26074242709 |
11 | 10070259519 |
12 | 50782649b1 |
13 | 25c6c693a8 |
14 | 1394cdd07b |
15 | a2916b824 |
hex | 612255e95 |
26074242709 has 4 divisors (see below), whose sum is σ = 26074698604. Its totient is φ = 26073786816.
The previous prime is 26074242613. The next prime is 26074242769. The reversal of 26074242709 is 90724247062.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 90724247062 = 2 ⋅45362123531.
It can be written as a sum of positive squares in 2 ways, for example, as 22703859684 + 3370383025 = 150678^2 + 58055^2 .
It is a cyclic number.
It is not a de Polignac number, because 26074242709 - 231 = 23926759061 is a prime.
It is a super-2 number, since 2×260742427092 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26074242769) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 127362 + ... + 261475.
It is an arithmetic number, because the mean of its divisors is an integer number (6518674651).
Almost surely, 226074242709 is an apocalyptic number.
It is an amenable number.
26074242709 is a deficient number, since it is larger than the sum of its proper divisors (455895).
26074242709 is an equidigital number, since it uses as much as digits as its factorization.
26074242709 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 455894.
The product of its (nonzero) digits is 338688, while the sum is 43.
The spelling of 26074242709 in words is "twenty-six billion, seventy-four million, two hundred forty-two thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •