Base | Representation |
---|---|
bin | 110100011011… |
… | …1011101000001 |
3 | 1220201122100100 |
4 | 1220313131001 |
5 | 24014140423 |
6 | 2421113013 |
7 | 452443050 |
oct | 150673501 |
9 | 56648310 |
10 | 27490113 |
11 | 14576802 |
12 | 9258769 |
13 | 5906751 |
14 | 3918397 |
15 | 2630343 |
hex | 1a37741 |
27490113 has 24 divisors (see below), whose sum is σ = 45675968. Its totient is φ = 15606432.
The previous prime is 27490109. The next prime is 27490123. The reversal of 27490113 is 31109472.
It is not a de Polignac number, because 27490113 - 22 = 27490109 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (27490123) 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 23 ways as a sum of consecutive naturals, for example, 8931 + ... + 11607.
Almost surely, 227490113 is an apocalyptic number.
It is an amenable number.
27490113 is a deficient number, since it is larger than the sum of its proper divisors (18185855).
27490113 is a wasteful number, since it uses less digits than its factorization.
27490113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2853 (or 2850 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 27.
The square root of 27490113 is about 5243.1014676430. The cubic root of 27490113 is about 301.8043592023.
Adding to 27490113 its reverse (31109472), we get a palindrome (58599585).
The spelling of 27490113 in words is "twenty-seven million, four hundred ninety thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •