Base | Representation |
---|---|
bin | 110010001101… |
… | …1010100000000 |
3 | 1211112111212010 |
4 | 1210123110000 |
5 | 23214420042 |
6 | 2340132520 |
7 | 436524660 |
oct | 144332400 |
9 | 54474763 |
10 | 26326272 |
11 | 13951355 |
12 | 8997140 |
13 | 55b9a9b |
14 | 36d41a0 |
15 | 24a059c |
hex | 191b500 |
26326272 has 144 divisors (see below), whose sum is σ = 82414080. Its totient is φ = 7305216.
The previous prime is 26326253. The next prime is 26326273. The reversal of 26326272 is 27262362.
It is a nude number because it is divisible by every one of its digits.
Its product of digits (12096) is a multiple of the sum of its prime factors (168).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26326273) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 317143 + ... + 317225.
It is an arithmetic number, because the mean of its divisors is an integer number (572320).
Almost surely, 226326272 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 26326272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41207040).
26326272 is an abundant number, since it is smaller than the sum of its proper divisors (56087808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26326272 is an equidigital number, since it uses as much as digits as its factorization.
26326272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168 (or 154 counting only the distinct ones).
The product of its digits is 12096, while the sum is 30.
The square root of 26326272 is about 5130.9133689822. The cubic root of 26326272 is about 297.4836636276.
The spelling of 26326272 in words is "twenty-six million, three hundred twenty-six thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •