Base | Representation |
---|---|
bin | 1100100000001010000111… |
… | …01100101001100000000000 |
3 | 10121100022210212120122100210 |
4 | 12100011003230221200000 |
5 | 12100422104142030423 |
6 | 134250113410514120 |
7 | 5535214441242420 |
oct | 620050354514000 |
9 | 117308725518323 |
10 | 27493221439488 |
11 | 883a89a834a52 |
12 | 3100454295940 |
13 | 12457a45a6b7c |
14 | 6b0971320480 |
15 | 32a266040b93 |
hex | 190143b29800 |
27493221439488 has 96 divisors (see below), whose sum is σ = 83768409204480. Its totient is φ = 7855206113280.
The previous prime is 27493221439459. The next prime is 27493221439511. The reversal of 27493221439488 is 88493412239472.
It is a tau number, because it is divible by the number of its divisors (96).
It is a super-2 number, since 2×274932214394882 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 319586148 + ... + 319672163.
It is an arithmetic number, because the mean of its divisors is an integer number (872587595880).
Almost surely, 227493221439488 is an apocalyptic number.
27493221439488 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
27493221439488 is an abundant number, since it is smaller than the sum of its proper divisors (56275187764992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27493221439488 is an equidigital number, since it uses as much as digits as its factorization.
27493221439488 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 639258343 (or 639258323 counting only the distinct ones).
The product of its digits is 167215104, while the sum is 66.
The spelling of 27493221439488 in words is "twenty-seven trillion, four hundred ninety-three billion, two hundred twenty-one million, four hundred thirty-nine thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •