Base | Representation |
---|---|
bin | 110010001001… |
… | …0001111010100 |
3 | 1211110121212200 |
4 | 1210102033110 |
5 | 23212222413 |
6 | 2335244500 |
7 | 436311426 |
oct | 144221724 |
9 | 54417780 |
10 | 26289108 |
11 | 1392643a |
12 | 8979730 |
13 | 55a5bb1 |
14 | 36c4816 |
15 | 2494573 |
hex | 19123d4 |
26289108 has 18 divisors (see below), whose sum is σ = 66453114. Its totient is φ = 8763024.
The previous prime is 26289083. The next prime is 26289119. The reversal of 26289108 is 80198262.
It can be written as a sum of positive squares in only one way, i.e., 17539344 + 8749764 = 4188^2 + 2958^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is a super-2 number, since 2×262891082 = 1382234398871328, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 730253 = 26289108 / (2 + 6 + 2 + 8 + 9 + 1 + 0 + 8).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 365091 + ... + 365162.
Almost surely, 226289108 is an apocalyptic number.
It is an amenable number.
26289108 is an abundant number, since it is smaller than the sum of its proper divisors (40164006).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26289108 is a wasteful number, since it uses less digits than its factorization.
26289108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 730263 (or 730258 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 36.
The square root of 26289108 is about 5127.2905125417. The cubic root of 26289108 is about 297.3436148165.
The spelling of 26289108 in words is "twenty-six million, two hundred eighty-nine thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •