Base | Representation |
---|---|
bin | 1000001101011110… |
… | …1000011101010001 |
3 | 12200121020022202220 |
4 | 2003113220131101 |
5 | 14003211312241 |
6 | 1002411331253 |
7 | 105421531032 |
oct | 20327503521 |
9 | 5617208686 |
10 | 2204010321 |
11 | a31119637 |
12 | 516150b29 |
13 | 291806b26 |
14 | 16ca02a89 |
15 | cd760166 |
hex | 835e8751 |
2204010321 has 8 divisors (see below), whose sum is σ = 2940173280. Its totient is φ = 1468593792.
The previous prime is 2204010301. The next prime is 2204010331. The reversal of 2204010321 is 1230104022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2204010321 - 26 = 2204010257 is a prime.
It is a super-2 number, since 2×22040103212 = 9715322990149046082, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2204010321.
It is not an unprimeable number, because it can be changed into a prime (2204010301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 179680 + ... + 191553.
It is an arithmetic number, because the mean of its divisors is an integer number (367521660).
Almost surely, 22204010321 is an apocalyptic number.
It is an amenable number.
2204010321 is a deficient number, since it is larger than the sum of its proper divisors (736162959).
2204010321 is a wasteful number, since it uses less digits than its factorization.
2204010321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373215.
The product of its (nonzero) digits is 96, while the sum is 15.
The square root of 2204010321 is about 46946.8882994390. Note that the first 3 decimals coincide. The cubic root of 2204010321 is about 1301.3812382388.
Adding to 2204010321 its reverse (1230104022), we get a palindrome (3434114343).
The spelling of 2204010321 in words is "two billion, two hundred four million, ten thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •