Base | Representation |
---|---|
bin | 11000011101000111… |
… | …101011101111011001 |
3 | 2111202222201202101111 |
4 | 120131013223233121 |
5 | 412234114412314 |
6 | 20021331420321 |
7 | 1616464232200 |
oct | 303507535731 |
9 | 74688652344 |
10 | 26258357209 |
11 | 10155181467 |
12 | 5109a546a1 |
13 | 2626150c96 |
14 | 13b1548237 |
15 | a3a3d8ec4 |
hex | 61d1ebbd9 |
26258357209 has 6 divisors (see below), whose sum is σ = 30545435994. Its totient is φ = 22507163280.
The previous prime is 26258357171. The next prime is 26258357243. The reversal of 26258357209 is 90275385262.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 16625523600 + 9632833609 = 128940^2 + 98147^2 .
It is a de Polignac number, because none of the positive numbers 2k-26258357209 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (49), and also a Moran number because the ratio is a prime number: 535884841 = 26258357209 / (2 + 6 + 2 + 5 + 8 + 3 + 5 + 7 + 2 + 0 + 9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (26258357249) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 267942372 + ... + 267942469.
It is an arithmetic number, because the mean of its divisors is an integer number (5090905999).
Almost surely, 226258357209 is an apocalyptic number.
It is an amenable number.
26258357209 is a deficient number, since it is larger than the sum of its proper divisors (4287078785).
26258357209 is an equidigital number, since it uses as much as digits as its factorization.
26258357209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 535884855 (or 535884848 counting only the distinct ones).
The product of its (nonzero) digits is 1814400, while the sum is 49.
The spelling of 26258357209 in words is "twenty-six billion, two hundred fifty-eight million, three hundred fifty-seven thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •