Base | Representation |
---|---|
bin | 110100010000… |
… | …0000100101000 |
3 | 1220112202222100 |
4 | 1220200010220 |
5 | 24003104334 |
6 | 2415053400 |
7 | 451563615 |
oct | 150400450 |
9 | 56482870 |
10 | 27394344 |
11 | 1451085a |
12 | 9211260 |
13 | 58a1c93 |
14 | 38d150c |
15 | 2611c99 |
hex | 1a20128 |
27394344 has 48 divisors (see below), whose sum is σ = 78560820. Its totient is φ = 8593920.
The previous prime is 27394337. The next prime is 27394387. The reversal of 27394344 is 44349372.
It can be written as a sum of positive squares in 2 ways, for example, as 26316900 + 1077444 = 5130^2 + 1038^2 .
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 27394299 and 27394308.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9967 + ... + 12414.
Almost surely, 227394344 is an apocalyptic number.
27394344 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
27394344 is an abundant number, since it is smaller than the sum of its proper divisors (51166476).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27394344 is a wasteful number, since it uses less digits than its factorization.
27394344 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22410 (or 22403 counting only the distinct ones).
The product of its digits is 72576, while the sum is 36.
The square root of 27394344 is about 5233.9606418085. The cubic root of 27394344 is about 301.4534799474.
The spelling of 27394344 in words is "twenty-seven million, three hundred ninety-four thousand, three hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •