Base | Representation |
---|---|
bin | 111011111001110… |
… | …0101011001010101 |
3 | 12012002012011001001 |
4 | 1313303211121111 |
5 | 13104030324341 |
6 | 531241303301 |
7 | 100544546011 |
oct | 16763453125 |
9 | 5162164031 |
10 | 2010011221 |
11 | 9416651a9 |
12 | 481194b31 |
13 | 26057106a |
14 | 150d43541 |
15 | bb6ddd31 |
hex | 77ce5655 |
2010011221 has 8 divisors (see below), whose sum is σ = 2057495264. Its totient is φ = 1962560880.
The previous prime is 2010011219. The next prime is 2010011231. The reversal of 2010011221 is 1221100102.
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 2010011221 - 21 = 2010011219 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2010011198 and 2010011207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010011231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 144586 + ... + 157876.
It is an arithmetic number, because the mean of its divisors is an integer number (257186908).
Almost surely, 22010011221 is an apocalyptic number.
It is an amenable number.
2010011221 is a deficient number, since it is larger than the sum of its proper divisors (47484043).
2010011221 is a wasteful number, since it uses less digits than its factorization.
2010011221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16851.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 2010011221 is about 44833.1486848738. The cubic root of 2010011221 is about 1262.0197766563.
Adding to 2010011221 its reverse (1221100102), we get a palindrome (3231111323).
The spelling of 2010011221 in words is "two billion, ten million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •