Base | Representation |
---|---|
bin | 110010111000… |
… | …1110000011110 |
3 | 1212012111120010 |
4 | 1211301300132 |
5 | 23312232400 |
6 | 2351504050 |
7 | 442531164 |
oct | 145616036 |
9 | 55174503 |
10 | 26680350 |
11 | 14073384 |
12 | 8b28026 |
13 | 56b1cb8 |
14 | 3787234 |
15 | 2520450 |
hex | 1971c1e |
26680350 has 48 divisors (see below), whose sum is σ = 66995712. Its totient is φ = 7025760.
The previous prime is 26680337. The next prime is 26680369. The reversal of 26680350 is 5308662.
It is a super-2 number, since 2×266803502 = 1423682152245000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
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, 11379 + ... + 13521.
It is an arithmetic number, because the mean of its divisors is an integer number (1395744).
Almost surely, 226680350 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26680350, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33497856).
26680350 is an abundant number, since it is smaller than the sum of its proper divisors (40315362).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26680350 is a wasteful number, since it uses less digits than its factorization.
26680350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2241 (or 2236 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 30.
The square root of 26680350 is about 5165.3025080822. The cubic root of 26680350 is about 298.8114081618.
The spelling of 26680350 in words is "twenty-six million, six hundred eighty thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •