Base | Representation |
---|---|
bin | 11010000001101100… |
… | …111111010110100100 |
3 | 2200010121001200221010 |
4 | 122001230333112210 |
5 | 424213114432333 |
6 | 20501012422220 |
7 | 2006344610013 |
oct | 320154772644 |
9 | 80117050833 |
10 | 27945858468 |
11 | 10940788100 |
12 | 54bb017970 |
13 | 2834942538 |
14 | 14d16d8a7a |
15 | ad861e563 |
hex | 681b3f5a4 |
27945858468 has 144 divisors (see below), whose sum is σ = 74890831680. Its totient is φ = 8094240000.
The previous prime is 27945858461. The next prime is 27945858469. The reversal of 27945858468 is 86485854972.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a junction number, because it is equal to n+sod(n) for n = 27945858399 and 27945858408.
It is not an unprimeable number, because it can be changed into a prime (27945858461) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4249623 + ... + 4256193.
It is an arithmetic number, because the mean of its divisors is an integer number (520075220).
Almost surely, 227945858468 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 27945858468, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37445415840).
27945858468 is an abundant number, since it is smaller than the sum of its proper divisors (46944973212).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27945858468 is a wasteful number, since it uses less digits than its factorization.
27945858468 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6730 (or 6717 counting only the distinct ones).
The product of its digits is 154828800, while the sum is 66.
The spelling of 27945858468 in words is "twenty-seven billion, nine hundred forty-five million, eight hundred fifty-eight thousand, four hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •