Base | Representation |
---|---|
bin | 11010000000000110… |
… | …100000101001011100 |
3 | 2200001201111211211021 |
4 | 122000012200221130 |
5 | 424134230302022 |
6 | 20454212533524 |
7 | 2005600351000 |
oct | 320006405134 |
9 | 80051454737 |
10 | 27918994012 |
11 | 109275a9478 |
12 | 54b20212a4 |
13 | 282c1c7800 |
14 | 14cbd04700 |
15 | ad60b47c7 |
hex | 6801a0a5c |
27918994012 has 108 divisors (see below), whose sum is σ = 61875886800. Its totient is φ = 11013047136.
The previous prime is 27918994007. The next prime is 27918994027. The reversal of 27918994012 is 21049981972.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It is a super-2 number, since 2×279189940122 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 80458023 + ... + 80458369.
Almost surely, 227918994012 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 27918994012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30937943400).
27918994012 is an abundant number, since it is smaller than the sum of its proper divisors (33956892788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27918994012 is an equidigital number, since it uses as much as digits as its factorization.
27918994012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 745 (or 369 counting only the distinct ones).
The product of its (nonzero) digits is 653184, while the sum is 52.
The spelling of 27918994012 in words is "twenty-seven billion, nine hundred eighteen million, nine hundred ninety-four thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •