Base | Representation |
---|---|
bin | 11001011001011110… |
… | …000100100110000101 |
3 | 2121101112221011221001 |
4 | 121121132010212011 |
5 | 421322314443031 |
6 | 20310021053301 |
7 | 1653540322651 |
oct | 313136044605 |
9 | 77345834831 |
10 | 27270859141 |
11 | 10624764119 |
12 | 5350b57231 |
13 | 2757b47756 |
14 | 1469bcba61 |
15 | a99239861 |
hex | 659784985 |
27270859141 has 8 divisors (see below), whose sum is σ = 27320639480. Its totient is φ = 27221116608.
The previous prime is 27270859127. The next prime is 27270859223. The reversal of 27270859141 is 14195807272.
It can be written as a sum of positive squares in 4 ways, for example, as 7409594241 + 19861264900 = 86079^2 + 140930^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a 4-Lehmer number, since φ(27270859141) divides (27270859141-1)4.
It is a cyclic number.
It is not a de Polignac number, because 27270859141 - 223 = 27262470533 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 27270859091 and 27270859100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27270859541) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1709695 + ... + 1725571.
It is an arithmetic number, because the mean of its divisors is an integer number (3415079935).
Almost surely, 227270859141 is an apocalyptic number.
It is an amenable number.
27270859141 is a deficient number, since it is larger than the sum of its proper divisors (49780339).
27270859141 is a wasteful number, since it uses less digits than its factorization.
27270859141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18903.
The product of its (nonzero) digits is 282240, while the sum is 46.
The spelling of 27270859141 in words is "twenty-seven billion, two hundred seventy million, eight hundred fifty-nine thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •