Base | Representation |
---|---|
bin | 11000010111100… |
… | …11100000000010 |
3 | 112020122200001200 |
4 | 30023303200002 |
5 | 404312433442 |
6 | 32141242030 |
7 | 5031356643 |
oct | 1413634002 |
9 | 466580050 |
10 | 204421122 |
11 | a5432684 |
12 | 58563316 |
13 | 33474759 |
14 | 1d2136ca |
15 | 12e2e34c |
hex | c2f3802 |
204421122 has 12 divisors (see below), whose sum is σ = 442912470. Its totient is φ = 68140368.
The previous prime is 204421109. The next prime is 204421153. The reversal of 204421122 is 221124402.
It can be written as a sum of positive squares in only one way, i.e., 146676321 + 57744801 = 12111^2 + 7599^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 11356729 = 204421122 / (2 + 0 + 4 + 4 + 2 + 1 + 1 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 204421095 and 204421104.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 5678347 + ... + 5678382.
Almost surely, 2204421122 is an apocalyptic number.
204421122 is an abundant number, since it is smaller than the sum of its proper divisors (238491348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204421122 is a wasteful number, since it uses less digits than its factorization.
204421122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11356737 (or 11356734 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
The square root of 204421122 is about 14297.5914754898. The cubic root of 204421122 is about 589.0813262122.
Adding to 204421122 its reverse (221124402), we get a palindrome (425545524).
The spelling of 204421122 in words is "two hundred four million, four hundred twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •