Base | Representation |
---|---|
bin | 10011010100000… |
… | …11010001110101 |
3 | 102021212101111021 |
4 | 21222003101311 |
5 | 312434042141 |
6 | 24024341141 |
7 | 4005063625 |
oct | 1152032165 |
9 | 367771437 |
10 | 162018421 |
11 | 83500924 |
12 | 463147b1 |
13 | 277493b6 |
14 | 17736885 |
15 | e3556d1 |
hex | 9a83475 |
162018421 has 8 divisors (see below), whose sum is σ = 163963800. Its totient is φ = 160078848.
The previous prime is 162018401. The next prime is 162018427. The reversal of 162018421 is 124810261.
It can be written as a sum of positive squares in 4 ways, for example, as 81270225 + 80748196 = 9015^2 + 8986^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 162018421 - 27 = 162018293 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (162018427) 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 7 ways as a sum of consecutive naturals, for example, 82155 + ... + 84103.
It is an arithmetic number, because the mean of its divisors is an integer number (20495475).
Almost surely, 2162018421 is an apocalyptic number.
It is an amenable number.
162018421 is a deficient number, since it is larger than the sum of its proper divisors (1945379).
162018421 is an equidigital number, since it uses as much as digits as its factorization.
162018421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2903.
The product of its (nonzero) digits is 768, while the sum is 25.
The square root of 162018421 is about 12728.6456860107. The cubic root of 162018421 is about 545.1568395223.
Adding to 162018421 its reverse (124810261), we get a palindrome (286828682).
The spelling of 162018421 in words is "one hundred sixty-two million, eighteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •