Base | Representation |
---|---|
bin | 110100000111… |
… | …1001010000101 |
3 | 1220102020221022 |
4 | 1220033022011 |
5 | 23443400221 |
6 | 2413400525 |
7 | 451154621 |
oct | 150171205 |
9 | 56366838 |
10 | 27325061 |
11 | 144737a5 |
12 | 9199145 |
13 | 587959a |
14 | 38b4181 |
15 | 25eb4ab |
hex | 1a0f285 |
27325061 has 4 divisors (see below), whose sum is σ = 27524652. Its totient is φ = 27125472.
The previous prime is 27325049. The next prime is 27325093. The reversal of 27325061 is 16052372.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8236900 + 19088161 = 2870^2 + 4369^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-27325061 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 27325061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27325031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 99590 + ... + 99863.
It is an arithmetic number, because the mean of its divisors is an integer number (6881163).
Almost surely, 227325061 is an apocalyptic number.
It is an amenable number.
27325061 is a deficient number, since it is larger than the sum of its proper divisors (199591).
27325061 is a wasteful number, since it uses less digits than its factorization.
27325061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199590.
The product of its (nonzero) digits is 2520, while the sum is 26.
The square root of 27325061 is about 5227.3378501872. The cubic root of 27325061 is about 301.1991301994.
The spelling of 27325061 in words is "twenty-seven million, three hundred twenty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •