Base | Representation |
---|---|
bin | 110011011001… |
… | …1010001011100 |
3 | 1212201010200000 |
4 | 1212303101130 |
5 | 23344324300 |
6 | 2401334300 |
7 | 445026432 |
oct | 146632134 |
9 | 55633600 |
10 | 26948700 |
11 | 14236a59 |
12 | 9037390 |
13 | 577719c |
14 | 3816d52 |
15 | 2574c00 |
hex | 19b345c |
26948700 has 108 divisors (see below), whose sum is σ = 87676680. Its totient is φ = 7179840.
The previous prime is 26948693. The next prime is 26948711. The reversal of 26948700 is 784962.
It is a tau number, because it is divible by the number of its divisors (108).
It is a Harshad number since it is a multiple of its sum of digits (36).
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 35 ways as a sum of consecutive naturals, for example, 23746 + ... + 24854.
Almost surely, 226948700 is an apocalyptic number.
26948700 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26948700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43838340).
26948700 is an abundant number, since it is smaller than the sum of its proper divisors (60727980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26948700 is a wasteful number, since it uses less digits than its factorization.
26948700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1138 (or 1119 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The square root of 26948700 is about 5191.2137309111. The cubic root of 26948700 is about 299.8098795395.
The spelling of 26948700 in words is "twenty-six million, nine hundred forty-eight thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •