Base | Representation |
---|---|
bin | 110001111010… |
… | …0010100000000 |
3 | 1211020101201200 |
4 | 1203310110000 |
5 | 23144312103 |
6 | 2332501200 |
7 | 435261153 |
oct | 143642400 |
9 | 54211650 |
10 | 26166528 |
11 | 13852333 |
12 | 891a800 |
13 | 556216b |
14 | 3691c9a |
15 | 246d0a3 |
hex | 18f4500 |
26166528 has 108 divisors (see below), whose sum is σ = 77563668. Its totient is φ = 8478720.
The previous prime is 26166527. The next prime is 26166601. The reversal of 26166528 is 82566162.
It can be written as a sum of positive squares in 2 ways, for example, as 2663424 + 23503104 = 1632^2 + 4848^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 26166492 and 26166501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26166523) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 94326 + ... + 94602.
Almost surely, 226166528 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26166528, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38781834).
26166528 is an abundant number, since it is smaller than the sum of its proper divisors (51397140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26166528 is a wasteful number, since it uses less digits than its factorization.
26166528 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340 (or 323 counting only the distinct ones).
The product of its digits is 34560, while the sum is 36.
The square root of 26166528 is about 5115.3228637106. The cubic root of 26166528 is about 296.8807465998.
The spelling of 26166528 in words is "twenty-six million, one hundred sixty-six thousand, five hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •