Base | Representation |
---|---|
bin | 110100110101… |
… | …0011111001000 |
3 | 1221010021002020 |
4 | 1221222133020 |
5 | 24042333034 |
6 | 2425404440 |
7 | 454303344 |
oct | 151523710 |
9 | 57107066 |
10 | 27699144 |
11 | 146a9860 |
12 | 9339720 |
13 | 597a935 |
14 | 3970624 |
15 | 2672249 |
hex | 1a6a7c8 |
27699144 has 64 divisors (see below), whose sum is σ = 76032000. Its totient is φ = 8339520.
The previous prime is 27699127. The next prime is 27699157. The reversal of 27699144 is 44199672.
It is a junction number, because it is equal to n+sod(n) for n = 27699096 and 27699105.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 62877 + ... + 63315.
It is an arithmetic number, because the mean of its divisors is an integer number (1188000).
Almost surely, 227699144 is an apocalyptic number.
27699144 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27699144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38016000).
27699144 is an abundant number, since it is smaller than the sum of its proper divisors (48332856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27699144 is a wasteful number, since it uses less digits than its factorization.
27699144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 698 (or 694 counting only the distinct ones).
The product of its digits is 108864, while the sum is 42.
The square root of 27699144 is about 5262.9976249282. The cubic root of 27699144 is about 302.5673879420.
The spelling of 27699144 in words is "twenty-seven million, six hundred ninety-nine thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •