Base | Representation |
---|---|
bin | 1100011011111101010011… |
… | …10100001011000000000000 |
3 | 10120211112022021020112202012 |
4 | 12031332221310023000000 |
5 | 12041041024341042210 |
6 | 134055525221512052 |
7 | 5521615244451023 |
oct | 615765164130000 |
9 | 116745267215665 |
10 | 27348905799680 |
11 | 8794673380843 |
12 | 3098499272628 |
13 | 1234cb58aaa6a |
14 | 6a79a08971ba |
15 | 32661b4eb305 |
hex | 18dfa9d0b000 |
27348905799680 has 624 divisors, whose sum is σ = 71320549386240. Its totient is φ = 10037801779200.
The previous prime is 27348905799629. The next prime is 27348905799697. The reversal of 27348905799680 is 8699750984372.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 143187988385 + ... + 143187988575.
Almost surely, 227348905799680 is an apocalyptic number.
27348905799680 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27348905799680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (35660274693120).
27348905799680 is an abundant number, since it is smaller than the sum of its proper divisors (43971643586560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27348905799680 is a wasteful number, since it uses less digits than its factorization.
27348905799680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 476 (or 401 counting only the distinct ones).
The product of its (nonzero) digits is 1646023680, while the sum is 77.
The spelling of 27348905799680 in words is "twenty-seven trillion, three hundred forty-eight billion, nine hundred five million, seven hundred ninety-nine thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •