Base | Representation |
---|---|
bin | 110010011110… |
… | …0001110010000 |
3 | 1211210100202201 |
4 | 1210330032100 |
5 | 23233223242 |
6 | 2343052544 |
7 | 440625661 |
oct | 144741620 |
9 | 54710681 |
10 | 26461072 |
11 | 13a33660 |
12 | 8a41154 |
13 | 5636251 |
14 | 372b368 |
15 | 24ca4b7 |
hex | 193c390 |
26461072 has 80 divisors (see below), whose sum is σ = 60621120. Its totient is φ = 11059200.
The previous prime is 26461051. The next prime is 26461081. The reversal of 26461072 is 27016462.
It is a self number, because there is not a number n which added to its sum of digits gives 26461072.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 137008 + ... + 137200.
It is an arithmetic number, because the mean of its divisors is an integer number (757764).
Almost surely, 226461072 is an apocalyptic number.
26461072 is a gapful number since it is divisible by the number (22) 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 26461072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30310560).
26461072 is an abundant number, since it is smaller than the sum of its proper divisors (34160048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26461072 is a wasteful number, since it uses less digits than its factorization.
26461072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272 (or 266 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 28.
The square root of 26461072 is about 5144.0326593053. The cubic root of 26461072 is about 297.9905406664.
The spelling of 26461072 in words is "twenty-six million, four hundred sixty-one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •