Base | Representation |
---|---|
bin | 11101001000100111000… |
… | …100010110011110101011 |
3 | 21002101210111120201122111 |
4 | 131020213010112132223 |
5 | 230300310203241021 |
6 | 4131431242103151 |
7 | 264435105003460 |
oct | 35104704263653 |
9 | 7071714521574 |
10 | 2002110212011 |
11 | 7020aa024358 |
12 | 2840327aaab7 |
13 | 116a4b7b9430 |
14 | 6cc8cc37667 |
15 | 3712d3b08e1 |
hex | 1d2271167ab |
2002110212011 has 16 divisors (see below), whose sum is σ = 2464169822464. Its totient is φ = 1584065229984.
The previous prime is 2002110212009. The next prime is 2002110212021. The reversal of 2002110212011 is 1102120112002.
It is a cyclic number.
It is not a de Polignac number, because 2002110212011 - 21 = 2002110212009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 2002110211982 and 2002110212000.
It is not an unprimeable number, because it can be changed into a prime (2002110212021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10537096 + ... + 10725418.
It is an arithmetic number, because the mean of its divisors is an integer number (154010613904).
Almost surely, 22002110212011 is an apocalyptic number.
2002110212011 is a deficient number, since it is larger than the sum of its proper divisors (462059610453).
2002110212011 is a wasteful number, since it uses less digits than its factorization.
2002110212011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305170.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2002110212011 its reverse (1102120112002), we get a palindrome (3104230324013).
It can be divided in two parts, 2002 and 110212011, that multiplied together give a palindrome (220644446022).
The spelling of 2002110212011 in words is "two trillion, two billion, one hundred ten million, two hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •