Base | Representation |
---|---|
bin | 110001101100… |
… | …1100000011100 |
3 | 1211000211010011 |
4 | 1203121200130 |
5 | 23132303412 |
6 | 2330253004 |
7 | 434323102 |
oct | 143314034 |
9 | 54024104 |
10 | 26056732 |
11 | 13787899 |
12 | 8887164 |
13 | 55241b0 |
14 | 3663c72 |
15 | 244a7a7 |
hex | 18d981c |
26056732 has 48 divisors (see below), whose sum is σ = 52284960. Its totient is φ = 11273472.
The previous prime is 26056729. The next prime is 26056739. The reversal of 26056732 is 23765062.
It is a junction number, because it is equal to n+sod(n) for n = 26056694 and 26056703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26056739) by changing a digit.
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, 55563 + ... + 56029.
It is an arithmetic number, because the mean of its divisors is an integer number (1089270).
Almost surely, 226056732 is an apocalyptic number.
It is an amenable number.
26056732 is an abundant number, since it is smaller than the sum of its proper divisors (26228228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26056732 is a wasteful number, since it uses less digits than its factorization.
26056732 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 550 (or 548 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 31.
The square root of 26056732 is about 5104.5795125554. The cubic root of 26056732 is about 296.4649225244.
The spelling of 26056732 in words is "twenty-six million, fifty-six thousand, seven hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •