Base | Representation |
---|---|
bin | 1100010011110011000101… |
… | …00010110001101110001100 |
3 | 10112211201121220020010101111 |
4 | 12021321202202301232030 |
5 | 12021442331004324431 |
6 | 133323040405221404 |
7 | 5462431404520402 |
oct | 611714242615614 |
9 | 115751556203344 |
10 | 27068537183116 |
11 | 869677a623480 |
12 | 3052092401864 |
13 | 1214723c83090 |
14 | 6981a4ac5472 |
15 | 31e1ac5437b1 |
hex | 189e628b1b8c |
27068537183116 has 24 divisors (see below), whose sum is σ = 55651398125904. Its totient is φ = 11357428188480.
The previous prime is 27068537183113. The next prime is 27068537183131. The reversal of 27068537183116 is 61138173586072.
It is a super-2 number, since 2×270685371831162 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (27068537183111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23661308155 + ... + 23661309298.
It is an arithmetic number, because the mean of its divisors is an integer number (2318808255246).
Almost surely, 227068537183116 is an apocalyptic number.
27068537183116 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is an amenable number.
27068537183116 is an abundant number, since it is smaller than the sum of its proper divisors (28582860942788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27068537183116 is a wasteful number, since it uses less digits than its factorization.
27068537183116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47322617481 (or 47322617479 counting only the distinct ones).
The product of its (nonzero) digits is 10160640, while the sum is 58.
The spelling of 27068537183116 in words is "twenty-seven trillion, sixty-eight billion, five hundred thirty-seven million, one hundred eighty-three thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •