Base | Representation |
---|---|
bin | 1100100001011101001010… |
… | …01100010101011111001110 |
3 | 10121111120220002211002101010 |
4 | 12100232211030111133032 |
5 | 12102134412020342123 |
6 | 134322405510030050 |
7 | 5541353344522521 |
oct | 620564514253716 |
9 | 117446802732333 |
10 | 27537806809038 |
11 | 885779a041aa9 |
12 | 3109017948326 |
13 | 1249a5b623346 |
14 | 6b2ba089abb8 |
15 | 32b4c537a993 |
hex | 190ba53157ce |
27537806809038 has 8 divisors (see below), whose sum is σ = 55075613618088. Its totient is φ = 9179268936344.
The previous prime is 27537806809001. The next prime is 27537806809043. The reversal of 27537806809038 is 83090860873572.
It is a sphenic number, since it is the product of 3 distinct primes.
27537806809038 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 27537806809038.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2294817234081 + ... + 2294817234092.
It is an arithmetic number, because the mean of its divisors is an integer number (6884451702261).
Almost surely, 227537806809038 is an apocalyptic number.
27537806809038 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27537806809038 is a wasteful number, since it uses less digits than its factorization.
27537806809038 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4589634468178.
The product of its (nonzero) digits is 121927680, while the sum is 66.
The spelling of 27537806809038 in words is "twenty-seven trillion, five hundred thirty-seven billion, eight hundred six million, eight hundred nine thousand, thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •