Base | Representation |
---|---|
bin | 110100010011… |
… | …0101000010110 |
3 | 1220121010211020 |
4 | 1220212220112 |
5 | 24004434311 |
6 | 2415422010 |
7 | 452035131 |
oct | 150465026 |
9 | 56533736 |
10 | 27421206 |
11 | 14529a5a |
12 | 9224906 |
13 | 58b1287 |
14 | 38db218 |
15 | 2619c06 |
hex | 1a26a16 |
27421206 has 8 divisors (see below), whose sum is σ = 54842424. Its totient is φ = 9140400.
The previous prime is 27421201. The next prime is 27421213. The reversal of 27421206 is 60212472.
It is a sphenic number, since it is the product of 3 distinct primes.
27421206 is an admirable number.
It is a Smith number, since the sum of its digits (24) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27421201) 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 3 ways as a sum of consecutive naturals, for example, 2285095 + ... + 2285106.
It is an arithmetic number, because the mean of its divisors is an integer number (6855303).
Almost surely, 227421206 is an apocalyptic number.
27421206 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27421206 is a wasteful number, since it uses less digits than its factorization.
27421206 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4570206.
The product of its (nonzero) digits is 1344, while the sum is 24.
The square root of 27421206 is about 5236.5261385770. The cubic root of 27421206 is about 301.5519795752.
Adding to 27421206 its reverse (60212472), we get a palindrome (87633678).
The spelling of 27421206 in words is "twenty-seven million, four hundred twenty-one thousand, two hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •