Base | Representation |
---|---|
bin | 11001100000100100… |
… | …111111100101001001 |
3 | 2121200212022222000011 |
4 | 121200210333211021 |
5 | 422043332122441 |
6 | 20325521111521 |
7 | 1656516062056 |
oct | 314044774511 |
9 | 77625288004 |
10 | 27390114121 |
11 | 10686007157 |
12 | 5384a885a1 |
13 | 2776770526 |
14 | 147b99202d |
15 | aa4944581 |
hex | 66093f949 |
27390114121 has 4 divisors (see below), whose sum is σ = 28580988672. Its totient is φ = 26199239572.
The previous prime is 27390114113. The next prime is 27390114131. The reversal of 27390114121 is 12141109372.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 27390114121 - 23 = 27390114113 is a prime.
It is a super-2 number, since 2×273901141212 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (27390114131) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 595437241 + ... + 595437286.
It is an arithmetic number, because the mean of its divisors is an integer number (7145247168).
Almost surely, 227390114121 is an apocalyptic number.
It is an amenable number.
27390114121 is a deficient number, since it is larger than the sum of its proper divisors (1190874551).
27390114121 is a wasteful number, since it uses less digits than its factorization.
27390114121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1190874550.
The product of its (nonzero) digits is 3024, while the sum is 31.
The spelling of 27390114121 in words is "twenty-seven billion, three hundred ninety million, one hundred fourteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •