Base | Representation |
---|---|
bin | 110100100100… |
… | …0111010101001 |
3 | 1220212021110112 |
4 | 1221020322221 |
5 | 24023433031 |
6 | 2422424105 |
7 | 453161432 |
oct | 151107251 |
9 | 56767415 |
10 | 27561641 |
11 | 14615518 |
12 | 9292035 |
13 | 5930183 |
14 | 3936489 |
15 | 264662b |
hex | 1a48ea9 |
27561641 has 6 divisors (see below), whose sum is σ = 29278590. Its totient is φ = 25940096.
The previous prime is 27561637. The next prime is 27561649. The reversal of 27561641 is 14616572.
It can be written as a sum of positive squares in 3 ways, for example, as 4713241 + 22848400 = 2171^2 + 4780^2 .
It is not a de Polignac number, because 27561641 - 22 = 27561637 is a prime.
It is a super-2 number, since 2×275616412 = 1519288109225762, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 27561598 and 27561607.
It is not an unprimeable number, because it can be changed into a prime (27561649) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 47396 + ... + 47973.
It is an arithmetic number, because the mean of its divisors is an integer number (4879765).
Almost surely, 227561641 is an apocalyptic number.
It is an amenable number.
27561641 is a deficient number, since it is larger than the sum of its proper divisors (1716949).
27561641 is an equidigital number, since it uses as much as digits as its factorization.
27561641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95403 (or 95386 counting only the distinct ones).
The product of its digits is 10080, while the sum is 32.
The square root of 27561641 is about 5249.9181898388. The cubic root of 27561641 is about 302.0658928190.
It can be divided in two parts, 275 and 61641, that added together give a palindrome (61916).
The spelling of 27561641 in words is "twenty-seven million, five hundred sixty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •