Base | Representation |
---|---|
bin | 110010000101001… |
… | …101100100110001 |
3 | 2011120000221221000 |
4 | 302011031210301 |
5 | 3210044231441 |
6 | 215212552213 |
7 | 26551545516 |
oct | 6205154461 |
9 | 2146027830 |
10 | 840227121 |
11 | 3a1317088 |
12 | 1b5482669 |
13 | 1050c8c16 |
14 | 7d83b30d |
15 | 4db712b6 |
hex | 3214d931 |
840227121 has 24 divisors (see below), whose sum is σ = 1289219360. Its totient is φ = 540821232.
The previous prime is 840227119. The next prime is 840227137. The reversal of 840227121 is 121722048.
It is not a de Polignac number, because 840227121 - 21 = 840227119 is a prime.
It is a super-2 number, since 2×8402271212 = 1411963229727897282, which contains 22 as substring.
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (840227111) 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 23 ways as a sum of consecutive naturals, for example, 4206 + ... + 41208.
Almost surely, 2840227121 is an apocalyptic number.
It is an amenable number.
840227121 is a deficient number, since it is larger than the sum of its proper divisors (448992239).
840227121 is a wasteful number, since it uses less digits than its factorization.
840227121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37070 (or 37035 counting only the distinct ones).
The product of its (nonzero) digits is 1792, while the sum is 27.
The square root of 840227121 is about 28986.6714370588. The cubic root of 840227121 is about 943.6238270807.
Adding to 840227121 its reverse (121722048), we get a palindrome (961949169).
The spelling of 840227121 in words is "eight hundred forty million, two hundred twenty-seven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •