Base | Representation |
---|---|
bin | 11001010010011010… |
… | …110111001001111001 |
3 | 2121002022100211112101 |
4 | 121102122313021321 |
5 | 421102024432040 |
6 | 20250153543401 |
7 | 1650603045331 |
oct | 312232671171 |
9 | 77068324471 |
10 | 27152577145 |
11 | 10573a16101 |
12 | 5319414b61 |
13 | 27394a27c5 |
14 | 14581dc0c1 |
15 | a8db7309a |
hex | 6526b7279 |
27152577145 has 8 divisors (see below), whose sum is σ = 32605838856. Its totient is φ = 21706897536.
The previous prime is 27152577143. The next prime is 27152577163. The reversal of 27152577145 is 54177525172.
It can be written as a sum of positive squares in 4 ways, for example, as 11867705721 + 15284871424 = 108939^2 + 123632^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 27152577145 - 21 = 27152577143 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 27152577095 and 27152577104.
It is not an unprimeable number, because it can be changed into a prime (27152577143) 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, 1887642 + ... + 1901971.
It is an arithmetic number, because the mean of its divisors is an integer number (4075729857).
Almost surely, 227152577145 is an apocalyptic number.
It is an amenable number.
27152577145 is a deficient number, since it is larger than the sum of its proper divisors (5453261711).
27152577145 is a wasteful number, since it uses less digits than its factorization.
27152577145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3791051.
The product of its digits is 686000, while the sum is 46.
The spelling of 27152577145 in words is "twenty-seven billion, one hundred fifty-two million, five hundred seventy-seven thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •