Base | Representation |
---|---|
bin | 110010010010… |
… | …1111001100000 |
3 | 1211121201100001 |
4 | 1210211321200 |
5 | 23222312012 |
6 | 2341105344 |
7 | 440065252 |
oct | 144457140 |
9 | 54551301 |
10 | 26369632 |
11 | 13980993 |
12 | 89b8254 |
13 | 5603743 |
14 | 3705cd2 |
15 | 24ad357 |
hex | 1925e60 |
26369632 has 48 divisors (see below), whose sum is σ = 53887680. Its totient is φ = 12694528.
The previous prime is 26369617. The next prime is 26369633. The reversal of 26369632 is 23696362.
It is a junction number, because it is equal to n+sod(n) for n = 26369591 and 26369600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26369633) 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 7 ways as a sum of consecutive naturals, for example, 133758 + ... + 133954.
It is an arithmetic number, because the mean of its divisors is an integer number (1122660).
Almost surely, 226369632 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 26369632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26943840).
26369632 is an abundant number, since it is smaller than the sum of its proper divisors (27518048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26369632 is a wasteful number, since it uses less digits than its factorization.
26369632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343 (or 335 counting only the distinct ones).
The product of its digits is 69984, while the sum is 37.
The square root of 26369632 is about 5135.1369991462. The cubic root of 26369632 is about 297.6468949494.
The spelling of 26369632 in words is "twenty-six million, three hundred sixty-nine thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •