Base | Representation |
---|---|
bin | 110010001010… |
… | …0010111101110 |
3 | 1211111001212000 |
4 | 1210110113232 |
5 | 23213012323 |
6 | 2335353130 |
7 | 436346040 |
oct | 144242756 |
9 | 54431760 |
10 | 26297838 |
11 | 13931a56 |
12 | 89827a6 |
13 | 55a9b68 |
14 | 36c7a90 |
15 | 2496e43 |
hex | 19145ee |
26297838 has 64 divisors (see below), whose sum is σ = 69120000. Its totient is φ = 7251552.
The previous prime is 26297833. The next prime is 26297839. The reversal of 26297838 is 83879262.
It is a junction number, because it is equal to n+sod(n) for n = 26297793 and 26297802.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26297833) 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 31 ways as a sum of consecutive naturals, for example, 9763 + ... + 12161.
It is an arithmetic number, because the mean of its divisors is an integer number (1080000).
Almost surely, 226297838 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26297838, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34560000).
26297838 is an abundant number, since it is smaller than the sum of its proper divisors (42822162).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26297838 is a wasteful number, since it uses less digits than its factorization.
26297838 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2446 (or 2440 counting only the distinct ones).
The product of its digits is 290304, while the sum is 45.
The square root of 26297838 is about 5128.1417687112. The cubic root of 26297838 is about 297.3765248018.
The spelling of 26297838 in words is "twenty-six million, two hundred ninety-seven thousand, eight hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •