Base | Representation |
---|---|
bin | 1000001100100001… |
… | …1010010011110100 |
3 | 12200022201121101002 |
4 | 2003020122103310 |
5 | 14001201121322 |
6 | 1002150022432 |
7 | 105342602045 |
oct | 20310322364 |
9 | 5608647332 |
10 | 2200020212 |
11 | a29943825 |
12 | 514947a18 |
13 | 290a3a910 |
14 | 16c2848cc |
15 | cd222c92 |
hex | 8321a4f4 |
2200020212 has 12 divisors (see below), whose sum is σ = 4146192036. Its totient is φ = 1015393920.
The previous prime is 2200020191. The next prime is 2200020217. The reversal of 2200020212 is 2120200022.
It can be written as a sum of positive squares in 2 ways, for example, as 1446737296 + 753282916 = 38036^2 + 27446^2 .
It is a junction number, because it is equal to n+sod(n) for n = 2200020193 and 2200020202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2200020217) 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, 21153989 + ... + 21154092.
It is an arithmetic number, because the mean of its divisors is an integer number (345516003).
Almost surely, 22200020212 is an apocalyptic number.
It is an amenable number.
2200020212 is a deficient number, since it is larger than the sum of its proper divisors (1946171824).
2200020212 is a wasteful number, since it uses less digits than its factorization.
2200020212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42308098 (or 42308096 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 11.
The square root of 2200020212 is about 46904.3730583834. The cubic root of 2200020212 is about 1300.5954298020.
Adding to 2200020212 its reverse (2120200022), we get a palindrome (4320220234).
The spelling of 2200020212 in words is "two billion, two hundred million, twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •