Base | Representation |
---|---|
bin | 110010000101… |
… | …1010111010110 |
3 | 1211102012020210 |
4 | 1210023113112 |
5 | 23210322300 |
6 | 2334510250 |
7 | 436133352 |
oct | 144132726 |
9 | 54365223 |
10 | 26260950 |
11 | 13907271 |
12 | 8965386 |
13 | 5596131 |
14 | 36b8462 |
15 | 248b050 |
hex | 190b5d6 |
26260950 has 48 divisors (see below), whose sum is σ = 67384080. Its totient is φ = 6760320.
The previous prime is 26260901. The next prime is 26260957. The reversal of 26260950 is 5906262.
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 (26260957) 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 23 ways as a sum of consecutive naturals, for example, 1332 + ... + 7368.
It is an arithmetic number, because the mean of its divisors is an integer number (1403835).
Almost surely, 226260950 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26260950, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33692040).
26260950 is an abundant number, since it is smaller than the sum of its proper divisors (41123130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26260950 is a wasteful number, since it uses less digits than its factorization.
26260950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6081 (or 6076 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 30.
The square root of 26260950 is about 5124.5438821421. The cubic root of 26260950 is about 297.2374163032.
The spelling of 26260950 in words is "twenty-six million, two hundred sixty thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •