Base | Representation |
---|---|
bin | 110010111111… |
… | …0010011011100 |
3 | 1212022010001110 |
4 | 1211332103130 |
5 | 23320403430 |
6 | 2352542020 |
7 | 443134050 |
oct | 145762334 |
9 | 55263043 |
10 | 26731740 |
11 | 140a8a52 |
12 | 8b51910 |
13 | 56cc4c9 |
14 | 379bc60 |
15 | 25307b0 |
hex | 197e4dc |
26731740 has 48 divisors (see below), whose sum is σ = 85542912. Its totient is φ = 6110016.
The previous prime is 26731739. The next prime is 26731741. The reversal of 26731740 is 4713762.
It is an interprime number because it is at equal distance from previous prime (26731739) and next prime (26731741).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 26731698 and 26731707.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26731741) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31404 + ... + 32243.
It is an arithmetic number, because the mean of its divisors is an integer number (1782144).
Almost surely, 226731740 is an apocalyptic number.
26731740 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
26731740 is an abundant number, since it is smaller than the sum of its proper divisors (58811172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26731740 is a wasteful number, since it uses less digits than its factorization.
26731740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63666 (or 63664 counting only the distinct ones).
The product of its (nonzero) digits is 7056, while the sum is 30.
The square root of 26731740 is about 5170.2746542133. The cubic root of 26731740 is about 299.0031356517.
The spelling of 26731740 in words is "twenty-six million, seven hundred thirty-one thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •