Base | Representation |
---|---|
bin | 11001110001001011… |
… | …110001000110011111 |
3 | 2122102021120022001000 |
4 | 121301023301012133 |
5 | 423131142321022 |
6 | 20413312321343 |
7 | 1666441121223 |
oct | 316113610637 |
9 | 78367508030 |
10 | 27668713887 |
11 | 108092a42a1 |
12 | 5442243253 |
13 | 27bc3b7769 |
14 | 14a6994783 |
15 | abe1276ac |
hex | 6712f119f |
27668713887 has 8 divisors (see below), whose sum is σ = 40990687280. Its totient is φ = 18445809240.
The previous prime is 27668713883. The next prime is 27668713889. The reversal of 27668713887 is 78831786672.
It is not a de Polignac number, because 27668713887 - 22 = 27668713883 is a prime.
It is a super-3 number, since 3×276687138873 (a number of 32 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27668713883) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 512383564 + ... + 512383617.
It is an arithmetic number, because the mean of its divisors is an integer number (5123835910).
Almost surely, 227668713887 is an apocalyptic number.
27668713887 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
27668713887 is a deficient number, since it is larger than the sum of its proper divisors (13321973393).
27668713887 is a wasteful number, since it uses less digits than its factorization.
27668713887 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1024767190 (or 1024767184 counting only the distinct ones).
The product of its digits is 37933056, while the sum is 63.
The spelling of 27668713887 in words is "twenty-seven billion, six hundred sixty-eight million, seven hundred thirteen thousand, eight hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •