Base | Representation |
---|---|
bin | 110100110001… |
… | …1111000111101 |
3 | 1221001220000112 |
4 | 1221203320331 |
5 | 24041002000 |
6 | 2425035405 |
7 | 454131515 |
oct | 151437075 |
9 | 57056015 |
10 | 27672125 |
11 | 14690528 |
12 | 9325b65 |
13 | 596b550 |
14 | 3964845 |
15 | 2669235 |
hex | 1a63e3d |
27672125 has 16 divisors (see below), whose sum is σ = 37193520. Its totient is φ = 20433600.
The previous prime is 27672103. The next prime is 27672187. The reversal of 27672125 is 52127672.
It can be written as a sum of positive squares in 8 ways, for example, as 9872164 + 17799961 = 3142^2 + 4219^2 .
It is not a de Polignac number, because 27672125 - 212 = 27668029 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 27672091 and 27672100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6890 + ... + 10139.
It is an arithmetic number, because the mean of its divisors is an integer number (2324595).
Almost surely, 227672125 is an apocalyptic number.
27672125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
27672125 is a deficient number, since it is larger than the sum of its proper divisors (9521395).
27672125 is a wasteful number, since it uses less digits than its factorization.
27672125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17057 (or 17047 counting only the distinct ones).
The product of its digits is 11760, while the sum is 32.
The square root of 27672125 is about 5260.4301154944. The cubic root of 27672125 is about 302.4689766240.
Adding to 27672125 its reverse (52127672), we get a palindrome (79799797).
The spelling of 27672125 in words is "twenty-seven million, six hundred seventy-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •