Base | Representation |
---|---|
bin | 110011101011… |
… | …1100000100101 |
3 | 1212222200021020 |
4 | 1213113200211 |
5 | 23414102000 |
6 | 2404441353 |
7 | 446215236 |
oct | 147274045 |
9 | 55880236 |
10 | 27097125 |
11 | 14328520 |
12 | 90a9259 |
13 | 57c9903 |
14 | 385508d |
15 | 25a3ba0 |
hex | 19d7825 |
27097125 has 32 divisors (see below), whose sum is σ = 49196160. Its totient is φ = 13136000.
The previous prime is 27097123. The next prime is 27097127. The reversal of 27097125 is 52179072.
It is an interprime number because it is at equal distance from previous prime (27097123) and next prime (27097127).
It is not a de Polignac number, because 27097125 - 21 = 27097123 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27097121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 841 + ... + 7409.
It is an arithmetic number, because the mean of its divisors is an integer number (1537380).
Almost surely, 227097125 is an apocalyptic number.
27097125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
27097125 is a deficient number, since it is larger than the sum of its proper divisors (22099035).
27097125 is a wasteful number, since it uses less digits than its factorization.
27097125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6598 (or 6588 counting only the distinct ones).
The product of its (nonzero) digits is 8820, while the sum is 33.
The square root of 27097125 is about 5205.4898904906. The cubic root of 27097125 is about 300.3592917486.
The spelling of 27097125 in words is "twenty-seven million, ninety-seven thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •