Base | Representation |
---|---|
bin | 1000001101000011… |
… | …0001001011011001 |
3 | 12200110211220121121 |
4 | 2003100301023121 |
5 | 14002231223113 |
6 | 1002305005241 |
7 | 105400325221 |
oct | 20320611331 |
9 | 5613756547 |
10 | 2202211033 |
11 | a300aa820 |
12 | 515623821 |
13 | 291326b69 |
14 | 16c695081 |
15 | cd506e8d |
hex | 834312d9 |
2202211033 has 8 divisors (see below), whose sum is σ = 2407840416. Its totient is φ = 1997486400.
The previous prime is 2202210971. The next prime is 2202211043. The reversal of 2202211033 is 3301122022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2202211033 - 225 = 2168656601 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2202210998 and 2202211016.
It is not an unprimeable number, because it can be changed into a prime (2202211043) 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 7 ways as a sum of consecutive naturals, for example, 221088 + ... + 230833.
It is an arithmetic number, because the mean of its divisors is an integer number (300980052).
Almost surely, 22202211033 is an apocalyptic number.
It is an amenable number.
2202211033 is a deficient number, since it is larger than the sum of its proper divisors (205629383).
2202211033 is a wasteful number, since it uses less digits than its factorization.
2202211033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 452375.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 2202211033 is about 46927.7213702093. The cubic root of 2202211033 is about 1301.0270056073.
Adding to 2202211033 its reverse (3301122022), we get a palindrome (5503333055).
The spelling of 2202211033 in words is "two billion, two hundred two million, two hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •