Base | Representation |
---|---|
bin | 110011100010… |
… | …1011100010101 |
3 | 1212211220202111 |
4 | 1213011130111 |
5 | 23404220000 |
6 | 2403111021 |
7 | 445456423 |
oct | 147053425 |
9 | 55756674 |
10 | 27023125 |
11 | 14287968 |
12 | 9072471 |
13 | 57a201c |
14 | 3836113 |
15 | 258bcba |
hex | 19c5715 |
27023125 has 10 divisors (see below), whose sum is σ = 33768878. Its totient is φ = 21618000.
The previous prime is 27023123. The next prime is 27023131. The reversal of 27023125 is 52132072.
It can be written as a sum of positive squares in 5 ways, for example, as 18740241 + 8282884 = 4329^2 + 2878^2 .
It is not a de Polignac number, because 27023125 - 21 = 27023123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 27023096 and 27023105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27023123) 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 9 ways as a sum of consecutive naturals, for example, 20994 + ... + 22243.
Almost surely, 227023125 is an apocalyptic number.
27023125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
27023125 is a deficient number, since it is larger than the sum of its proper divisors (6745753).
27023125 is an frugal number, since it uses more digits than its factorization.
27023125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43257 (or 43242 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 22.
The square root of 27023125 is about 5198.3771506115. The cubic root of 27023125 is about 300.0856237078.
Adding to 27023125 its reverse (52132072), we get a palindrome (79155197).
The spelling of 27023125 in words is "twenty-seven million, twenty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •