Base | Representation |
---|---|
bin | 11001110001101000… |
… | …110000110110100101 |
3 | 2122102210212110212101 |
4 | 121301220300312211 |
5 | 423140114040140 |
6 | 20414143252101 |
7 | 1666562540101 |
oct | 316150606645 |
9 | 78383773771 |
10 | 27676315045 |
11 | 10812616145 |
12 | 54448aa031 |
13 | 27c0b494a2 |
14 | 14a79b2901 |
15 | abeb2999a |
hex | 671a30da5 |
27676315045 has 8 divisors (see below), whose sum is σ = 33213583224. Its totient is φ = 22139715264.
The previous prime is 27676314973. The next prime is 27676315091. The reversal of 27676315045 is 54051367672.
It is a Cunningham number, because it is equal to 1663622+1.
It can be written as a sum of positive squares in 4 ways, for example, as 2260622116 + 25415692929 = 47546^2 + 159423^2 .
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 27676315045 - 27 = 27676314917 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 27676314986 and 27676315004.
It is a congruent number.
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, 70974 + ... + 245743.
It is an arithmetic number, because the mean of its divisors is an integer number (4151697903).
Almost surely, 227676315045 is an apocalyptic number.
It is an amenable number.
27676315045 is a deficient number, since it is larger than the sum of its proper divisors (5537268179).
27676315045 is a wasteful number, since it uses less digits than its factorization.
27676315045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334199.
The product of its (nonzero) digits is 1058400, while the sum is 46.
The spelling of 27676315045 in words is "twenty-seven billion, six hundred seventy-six million, three hundred fifteen thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •