Base | Representation |
---|---|
bin | 11001001100111010… |
… | …000111001110100001 |
3 | 2120211212100211011112 |
4 | 121030322013032201 |
5 | 420404341344040 |
6 | 20233051553105 |
7 | 1645401051512 |
oct | 311472071641 |
9 | 76755324145 |
10 | 27060106145 |
11 | 105267a7296 |
12 | 52b245b795 |
13 | 2723296c37 |
14 | 1449c0aa09 |
15 | a859a9365 |
hex | 64ce873a1 |
27060106145 has 8 divisors (see below), whose sum is σ = 32486204520. Its totient is φ = 21638700160.
The previous prime is 27060106141. The next prime is 27060106159. The reversal of 27060106145 is 54160106072.
It can be written as a sum of positive squares in 4 ways, for example, as 3356116624 + 23703989521 = 57932^2 + 153961^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 27060106145 - 22 = 27060106141 is a prime.
It is a super-2 number, since 2×270601061452 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (27060106141) 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 7 ways as a sum of consecutive naturals, for example, 1160396 + ... + 1183485.
It is an arithmetic number, because the mean of its divisors is an integer number (4060775565).
Almost surely, 227060106145 is an apocalyptic number.
It is an amenable number.
27060106145 is a deficient number, since it is larger than the sum of its proper divisors (5426098375).
27060106145 is a wasteful number, since it uses less digits than its factorization.
27060106145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2346195.
The product of its (nonzero) digits is 10080, while the sum is 32.
The spelling of 27060106145 in words is "twenty-seven billion, sixty million, one hundred six thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •