Base | Representation |
---|---|
bin | 1000001100100100… |
… | …1000111001000100 |
3 | 12200100002022002202 |
4 | 2003021020321010 |
5 | 14001223223022 |
6 | 1002154054032 |
7 | 105344325236 |
oct | 20311107104 |
9 | 5610068082 |
10 | 2200211012 |
11 | a29a6410a |
12 | 514a1a318 |
13 | 290aa670c |
14 | 16c2d4256 |
15 | cd25e592 |
hex | 83248e44 |
2200211012 has 12 divisors (see below), whose sum is σ = 3858724716. Its totient is φ = 1097718240.
The previous prime is 2200211011. The next prime is 2200211051. The reversal of 2200211012 is 2101120022.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 611869696 + 1588341316 = 24736^2 + 39854^2 .
It is a junction number, because it is equal to n+sod(n) for n = 2200210984 and 2200211002.
It is not an unprimeable number, because it can be changed into a prime (2200211011) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 594743 + ... + 598430.
It is an arithmetic number, because the mean of its divisors is an integer number (321560393).
Almost surely, 22200211012 is an apocalyptic number.
It is an amenable number.
2200211012 is a deficient number, since it is larger than the sum of its proper divisors (1658513704).
2200211012 is a wasteful number, since it uses less digits than its factorization.
2200211012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1193638 (or 1193636 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
The square root of 2200211012 is about 46906.4069397774. The cubic root of 2200211012 is about 1300.6330274012.
Adding to 2200211012 its reverse (2101120022), we get a palindrome (4301331034).
The spelling of 2200211012 in words is "two billion, two hundred million, two hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •