Base | Representation |
---|---|
bin | 110011001110… |
… | …0110100000000 |
3 | 1212112110110202 |
4 | 1212130310000 |
5 | 23333403304 |
6 | 2355344332 |
7 | 444164300 |
oct | 146346400 |
9 | 55473422 |
10 | 26856704 |
11 | 14183926 |
12 | 8bb20a8 |
13 | 5744354 |
14 | 37d1600 |
15 | 255781e |
hex | 199cd00 |
26856704 has 54 divisors (see below), whose sum is σ = 62390034. Its totient is φ = 11504640.
The previous prime is 26856689. The next prime is 26856733. The reversal of 26856704 is 40765862.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 26543104 + 313600 = 5152^2 + 560^2 .
It is a Smith number, since the sum of its digits (38) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 11474 + ... + 13614.
It is an arithmetic number, because the mean of its divisors is an integer number (1155371).
Almost surely, 226856704 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 26856704, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31195017).
26856704 is an abundant number, since it is smaller than the sum of its proper divisors (35533330).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26856704 is an equidigital number, since it uses as much as digits as its factorization.
26856704 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2171 (or 2150 counting only the distinct ones).
The product of its (nonzero) digits is 80640, while the sum is 38.
The square root of 26856704 is about 5182.3454149642. The cubic root of 26856704 is about 299.4683323959.
The spelling of 26856704 in words is "twenty-six million, eight hundred fifty-six thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •