Base | Representation |
---|---|
bin | 11010000000001011… |
… | …111001001000000000 |
3 | 2200001211011112022210 |
4 | 122000023321020000 |
5 | 424140110424432 |
6 | 20454303102120 |
7 | 2005615345434 |
oct | 320013711000 |
9 | 80054145283 |
10 | 27920404992 |
11 | 10928382577 |
12 | 54b25a1940 |
13 | 282c59cacc |
14 | 14cc1909c4 |
15 | ad62928cc |
hex | 6802f9200 |
27920404992 has 160 divisors (see below), whose sum is σ = 77089351680. Its totient is φ = 8973619200.
The previous prime is 27920404991. The next prime is 27920404999. The reversal of 27920404992 is 29940402972.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (27920404991) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5215117 + ... + 5220467.
It is an arithmetic number, because the mean of its divisors is an integer number (481808448).
Almost surely, 227920404992 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 27920404992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38544675840).
27920404992 is an abundant number, since it is smaller than the sum of its proper divisors (49168946688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27920404992 is an equidigital number, since it uses as much as digits as its factorization.
27920404992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5494 (or 5478 counting only the distinct ones).
The product of its (nonzero) digits is 653184, while the sum is 48.
The spelling of 27920404992 in words is "twenty-seven billion, nine hundred twenty million, four hundred four thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •