Base | Representation |
---|---|
bin | 110010110111… |
… | …1110101000000 |
3 | 1212012002201110 |
4 | 1211233311000 |
5 | 23312004243 |
6 | 2351403320 |
7 | 442466145 |
oct | 145576500 |
9 | 55162643 |
10 | 26672448 |
11 | 14068450 |
12 | 8b23540 |
13 | 56ab51a |
14 | 37843cc |
15 | 251ce33 |
hex | 196fd40 |
26672448 has 112 divisors (see below), whose sum is σ = 78492096. Its totient is φ = 7925760.
The previous prime is 26672441. The next prime is 26672461. The reversal of 26672448 is 84427662.
It is a super-2 number, since 2×266724482 = 1422838964625408, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26672441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 154090 + ... + 154262.
Almost surely, 226672448 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 26672448, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39246048).
26672448 is an abundant number, since it is smaller than the sum of its proper divisors (51819648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26672448 is a wasteful number, since it uses less digits than its factorization.
26672448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272 (or 262 counting only the distinct ones).
The product of its digits is 129024, while the sum is 39.
The square root of 26672448 is about 5164.5375397997. The cubic root of 26672448 is about 298.7819052893.
It can be divided in two parts, 2667 and 2448, that added together give a palindrome (5115).
The spelling of 26672448 in words is "twenty-six million, six hundred seventy-two thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •