Base | Representation |
---|---|
bin | 11101001000100111000… |
… | …011100111111001100111 |
3 | 21002101210111020000221021 |
4 | 131020213003213321213 |
5 | 230300310131134343 |
6 | 4131431234032011 |
7 | 264435103250314 |
oct | 35104703477147 |
9 | 7071714200837 |
10 | 2002110021223 |
11 | 7020a9a03a84 |
12 | 284032718607 |
13 | 116a4b750640 |
14 | 6cc8cbc7d0b |
15 | 3712d3740ed |
hex | 1d2270e7e67 |
2002110021223 has 16 divisors (see below), whose sum is σ = 2356592507136. Its totient is φ = 1683280350720.
The previous prime is 2002110021187. The next prime is 2002110021251. The reversal of 2002110021223 is 3221200112002.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 2002110021223 - 237 = 1864671067751 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2002110021197 and 2002110021206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002110021283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 146111236 + ... + 146124937.
It is an arithmetic number, because the mean of its divisors is an integer number (147287031696).
Almost surely, 22002110021223 is an apocalyptic number.
2002110021223 is a deficient number, since it is larger than the sum of its proper divisors (354482485913).
2002110021223 is a wasteful number, since it uses less digits than its factorization.
2002110021223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292236234.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 2002110021223 its reverse (3221200112002), we get a palindrome (5223310133225).
The spelling of 2002110021223 in words is "two trillion, two billion, one hundred ten million, twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •