Base | Representation |
---|---|
bin | 11001001110111010… |
… | …000101110100001001 |
3 | 2120221012111021021001 |
4 | 121032322011310021 |
5 | 420441433423133 |
6 | 20240251015001 |
7 | 1646256160132 |
oct | 311672056411 |
9 | 76835437231 |
10 | 27093654793 |
11 | 10543730947 |
12 | 530173a461 |
13 | 272a2121ca |
14 | 1450460c89 |
15 | a888d487d |
hex | 64ee85d09 |
27093654793 has 8 divisors (see below), whose sum is σ = 28321166016. Its totient is φ = 25870270800.
The previous prime is 27093654761. The next prime is 27093654821. The reversal of 27093654793 is 39745639072.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 27093654793 - 25 = 27093654761 is a prime.
It is a super-2 number, since 2×270936547932 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (27093654493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1018378 + ... + 1044643.
It is an arithmetic number, because the mean of its divisors is an integer number (3540145752).
Almost surely, 227093654793 is an apocalyptic number.
27093654793 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
27093654793 is a deficient number, since it is larger than the sum of its proper divisors (1227511223).
27093654793 is a wasteful number, since it uses less digits than its factorization.
27093654793 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2063615.
The product of its (nonzero) digits is 8573040, while the sum is 55.
The spelling of 27093654793 in words is "twenty-seven billion, ninety-three million, six hundred fifty-four thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •