Base | Representation |
---|---|
bin | 1000001101000001… |
… | …0110010100010100 |
3 | 12200110122022200202 |
4 | 2003100112110110 |
5 | 14002214213022 |
6 | 1002302400032 |
7 | 105366356366 |
oct | 20320262424 |
9 | 5613568622 |
10 | 2202101012 |
11 | a300350a1 |
12 | 515590018 |
13 | 2912b8a67 |
14 | 16c666d36 |
15 | cd4d4592 |
hex | 83416514 |
2202101012 has 12 divisors (see below), whose sum is σ = 3896977140. Its totient is φ = 1088678976.
The previous prime is 2202100987. The next prime is 2202101017. The reversal of 2202101012 is 2101012022.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 148742416 + 2053358596 = 12196^2 + 45314^2 .
It is a junction number, because it is equal to n+sod(n) for n = 2202100984 and 2202101002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2202101017) 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, 3092483 + ... + 3093194.
It is an arithmetic number, because the mean of its divisors is an integer number (324748095).
Almost surely, 22202101012 is an apocalyptic number.
It is an amenable number.
2202101012 is a deficient number, since it is larger than the sum of its proper divisors (1694876128).
2202101012 is a wasteful number, since it uses less digits than its factorization.
2202101012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6185770 (or 6185768 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
The square root of 2202101012 is about 46926.5491166781. The cubic root of 2202101012 is about 1301.0053390982.
Adding to 2202101012 its reverse (2101012022), we get a palindrome (4303113034).
The spelling of 2202101012 in words is "two billion, two hundred two million, one hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •