Base | Representation |
---|---|
bin | 110100100101… |
… | …0100100001110 |
3 | 1220212121201210 |
4 | 1221022210032 |
5 | 24024142043 |
6 | 2422515250 |
7 | 453220224 |
oct | 151124416 |
9 | 56777653 |
10 | 27568398 |
11 | 1461a600 |
12 | 9295b26 |
13 | 5933280 |
14 | 3938b14 |
15 | 2648633 |
hex | 1a4a90e |
27568398 has 96 divisors (see below), whose sum is σ = 68640768. Its totient is φ = 7318080.
The previous prime is 27568397. The next prime is 27568417. The reversal of 27568398 is 89386572.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27568391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 217011 + ... + 217137.
It is an arithmetic number, because the mean of its divisors is an integer number (715008).
Almost surely, 227568398 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27568398, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34320384).
27568398 is an abundant number, since it is smaller than the sum of its proper divisors (41072370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27568398 is a wasteful number, since it uses less digits than its factorization.
27568398 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190 (or 179 counting only the distinct ones).
The product of its digits is 725760, while the sum is 48.
The square root of 27568398 is about 5250.5616842391. The cubic root of 27568398 is about 302.0905755833.
It can be divided in two parts, 27568 and 398, that added together give a triangular number (27966 = T236).
The spelling of 27568398 in words is "twenty-seven million, five hundred sixty-eight thousand, three hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •