Base | Representation |
---|---|
bin | 1100100000100001010110… |
… | …00101000101110100101000 |
3 | 10121101112000001121201221110 |
4 | 12100100223011011310220 |
5 | 12101123124442142230 |
6 | 134255535134310320 |
7 | 5536135502411511 |
oct | 620205305056450 |
9 | 117345001551843 |
10 | 27505693318440 |
11 | 884510a896227 |
12 | 31029550583a0 |
13 | 1246a11428abc |
14 | 6b13d5893a08 |
15 | 32a745e224b0 |
hex | 19042b145d28 |
27505693318440 has 32 divisors (see below), whose sum is σ = 82517079955680. Its totient is φ = 7334851551552.
The previous prime is 27505693318373. The next prime is 27505693318451. The reversal of 27505693318440 is 4481339650572.
It is an unprimeable number.
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, 114607055374 + ... + 114607055613.
It is an arithmetic number, because the mean of its divisors is an integer number (2578658748615).
It is a 1-persistent number, because it is pandigital, but 2⋅27505693318440 = 55011386636880 is not.
Almost surely, 227505693318440 is an apocalyptic number.
27505693318440 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
27505693318440 is an abundant number, since it is smaller than the sum of its proper divisors (55011386637240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27505693318440 is a wasteful number, since it uses less digits than its factorization.
27505693318440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229214111001 (or 229214110997 counting only the distinct ones).
The product of its (nonzero) digits is 21772800, while the sum is 57.
The spelling of 27505693318440 in words is "twenty-seven trillion, five hundred five billion, six hundred ninety-three million, three hundred eighteen thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •