Base | Representation |
---|---|
bin | 110011101111… |
… | …0010111101001 |
3 | 1220001002210222 |
4 | 1213132113221 |
5 | 23421001400 |
6 | 2405215425 |
7 | 446363201 |
oct | 147362751 |
9 | 56032728 |
10 | 27125225 |
11 | 14347646 |
12 | 9101575 |
13 | 580963a |
14 | 3861401 |
15 | 25ac185 |
hex | 19de5e9 |
27125225 has 12 divisors (see below), whose sum is σ = 33765324. Its totient is φ = 21616320.
The previous prime is 27125221. The next prime is 27125227. The reversal of 27125225 is 52252172.
27125225 = 5642 + 5652 + ... + 6382.
It can be written as a sum of positive squares in 6 ways, for example, as 633616 + 26491609 = 796^2 + 5147^2 .
It is not a de Polignac number, because 27125225 - 22 = 27125221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 27125194 and 27125203.
It is not an unprimeable number, because it can be changed into a prime (27125221) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4967 + ... + 8883.
It is an arithmetic number, because the mean of its divisors is an integer number (2813777).
Almost surely, 227125225 is an apocalyptic number.
27125225 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
27125225 is a deficient number, since it is larger than the sum of its proper divisors (6640099).
27125225 is a wasteful number, since it uses less digits than its factorization.
27125225 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4204 (or 4199 counting only the distinct ones).
The product of its digits is 2800, while the sum is 26.
The square root of 27125225 is about 5208.1882646464. The cubic root of 27125225 is about 300.4630811148.
Adding to 27125225 its reverse (52252172), we get a palindrome (79377397).
The spelling of 27125225 in words is "twenty-seven million, one hundred twenty-five thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •