Base | Representation |
---|---|
bin | 110011110001… |
… | …0010100101101 |
3 | 1220001221000211 |
4 | 1213202110231 |
5 | 23422011141 |
6 | 2405422421 |
7 | 446461336 |
oct | 147422455 |
9 | 56057024 |
10 | 27141421 |
11 | 1435882a |
12 | 910aa11 |
13 | 5813b18 |
14 | 386728d |
15 | 25b1d81 |
hex | 19e252d |
27141421 has 4 divisors (see below), whose sum is σ = 27161344. Its totient is φ = 27121500.
The previous prime is 27141409. The next prime is 27141437. The reversal of 27141421 is 12414172.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 27141421 - 221 = 25044269 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 27141392 and 27141401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27141721) 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 3 ways as a sum of consecutive naturals, for example, 7755 + ... + 10696.
It is an arithmetic number, because the mean of its divisors is an integer number (6790336).
Almost surely, 227141421 is an apocalyptic number.
It is an amenable number.
27141421 is a deficient number, since it is larger than the sum of its proper divisors (19923).
27141421 is a wasteful number, since it uses less digits than its factorization.
27141421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19922.
The product of its digits is 448, while the sum is 22.
The square root of 27141421 is about 5209.7428919285. The cubic root of 27141421 is about 300.5228696432.
Adding to 27141421 its reverse (12414172), we get a palindrome (39555593).
The spelling of 27141421 in words is "twenty-seven million, one hundred forty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •