Base | Representation |
---|---|
bin | 110010101010… |
… | …0110000001110 |
3 | 1211222110121010 |
4 | 1211110300032 |
5 | 23244432200 |
6 | 2345150050 |
7 | 441524631 |
oct | 145246016 |
9 | 54873533 |
10 | 26561550 |
11 | 13aa20a4 |
12 | 8a8b326 |
13 | 566cbc2 |
14 | 3755c18 |
15 | 24ea150 |
hex | 1954c0e |
26561550 has 48 divisors (see below), whose sum is σ = 68745600. Its totient is φ = 6774240.
The previous prime is 26561539. The next prime is 26561551. The reversal of 26561550 is 5516562.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26561551) 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 23 ways as a sum of consecutive naturals, for example, 400 + ... + 7299.
It is an arithmetic number, because the mean of its divisors is an integer number (1432200).
Almost surely, 226561550 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26561550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34372800).
26561550 is an abundant number, since it is smaller than the sum of its proper divisors (42184050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26561550 is a wasteful number, since it uses less digits than its factorization.
26561550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7737 (or 7732 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 30.
The square root of 26561550 is about 5153.7898676605. The cubic root of 26561550 is about 298.3672408915.
The spelling of 26561550 in words is "twenty-six million, five hundred sixty-one thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •