Base | Representation |
---|---|
bin | 1100100100011000010011… |
… | …00101010010011001010001 |
3 | 10121212012012221001012222121 |
4 | 12102030021211102121101 |
5 | 12110311141440210002 |
6 | 134440503130534241 |
7 | 5551541141003422 |
oct | 622141145223121 |
9 | 117765187035877 |
10 | 27638275319377 |
11 | 8896365986928 |
12 | 3124596597381 |
13 | 1256380210b28 |
14 | 6b79b1c37649 |
15 | 32de057ad237 |
hex | 192309952651 |
27638275319377 has 8 divisors (see below), whose sum is σ = 28955650986752. Its totient is φ = 26347513302000.
The previous prime is 27638275319353. The next prime is 27638275319387. The reversal of 27638275319377 is 77391357283672.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-27638275319377 is a prime.
It is a super-3 number, since 3×276382753193773 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (27638275319327) 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, 6653410374 + ... + 6653414527.
It is an arithmetic number, because the mean of its divisors is an integer number (3619456373344).
Almost surely, 227638275319377 is an apocalyptic number.
It is an amenable number.
27638275319377 is a deficient number, since it is larger than the sum of its proper divisors (1317375667375).
27638275319377 is a wasteful number, since it uses less digits than its factorization.
27638275319377 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13306824999.
The product of its digits is 560105280, while the sum is 70.
The spelling of 27638275319377 in words is "twenty-seven trillion, six hundred thirty-eight billion, two hundred seventy-five million, three hundred nineteen thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •