Base | Representation |
---|---|
bin | 110011000101… |
… | …0010101111000 |
3 | 1212101121200200 |
4 | 1212022111320 |
5 | 23323443143 |
6 | 2354002200 |
7 | 443430600 |
oct | 146122570 |
9 | 55347620 |
10 | 26781048 |
11 | 14131aa8 |
12 | 8b76360 |
13 | 5718a98 |
14 | 37b1c00 |
15 | 25401d3 |
hex | 198a578 |
26781048 has 72 divisors (see below), whose sum is σ = 84385080. Its totient is φ = 7650720.
The previous prime is 26781037. The next prime is 26781067. The reversal of 26781048 is 84018762.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 268 + ... + 7323.
It is an arithmetic number, because the mean of its divisors is an integer number (1172015).
Almost surely, 226781048 is an apocalyptic number.
26781048 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26781048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42192540).
26781048 is an abundant number, since it is smaller than the sum of its proper divisors (57604032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26781048 is a wasteful number, since it uses less digits than its factorization.
26781048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7617 (or 7603 counting only the distinct ones).
The product of its (nonzero) digits is 21504, while the sum is 36.
The square root of 26781048 is about 5175.0408694038. The cubic root of 26781048 is about 299.1868646945.
The spelling of 26781048 in words is "twenty-six million, seven hundred eighty-one thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •