Base | Representation |
---|---|
bin | 11010000001010111… |
… | …000111101011100000 |
3 | 2200010012021102122120 |
4 | 122001113013223200 |
5 | 424210133003113 |
6 | 20500245504240 |
7 | 2006245101366 |
oct | 320127075340 |
9 | 80105242576 |
10 | 27940125408 |
11 | 10938521838 |
12 | 54b9112080 |
13 | 28336b5bb0 |
14 | 14d0a45636 |
15 | ad7d8aa23 |
hex | 6815c7ae0 |
27940125408 has 192 divisors, whose sum is σ = 81812570112. Its totient is φ = 8291082240.
The previous prime is 27940125401. The next prime is 27940125427. The reversal of 27940125408 is 80452104972.
It is a Cunningham number, because it is equal to 1671532-1.
It is a self number, because there is not a number n which added to its sum of digits gives 27940125408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27940125401) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13036785 + ... + 13038927.
It is an arithmetic number, because the mean of its divisors is an integer number (426107136).
Almost surely, 227940125408 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27940125408, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40906285056).
27940125408 is an abundant number, since it is smaller than the sum of its proper divisors (53872444704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27940125408 is a wasteful number, since it uses less digits than its factorization.
27940125408 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2537 (or 2529 counting only the distinct ones).
The product of its (nonzero) digits is 161280, while the sum is 42.
The spelling of 27940125408 in words is "twenty-seven billion, nine hundred forty million, one hundred twenty-five thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •