Base | Representation |
---|---|
bin | 11101001000100001001… |
… | …110100010101011100101 |
3 | 21002101112200012020001200 |
4 | 131020201032202223211 |
5 | 230300110112021013 |
6 | 4131413421513113 |
7 | 264432505044042 |
oct | 35104116425345 |
9 | 7071480166050 |
10 | 2002012220133 |
11 | 702059784632 |
12 | 284005a12799 |
13 | 116a343c9983 |
14 | 6cc7dc0a1c9 |
15 | 371249a5e73 |
hex | 1d2213a2ae5 |
2002012220133 has 24 divisors (see below), whose sum is σ = 3018355109952. Its totient is φ = 1276294555008.
The previous prime is 2002012220113. The next prime is 2002012220137. The reversal of 2002012220133 is 3310222102002.
It is a de Polignac number, because none of the positive numbers 2k-2002012220133 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002012220137) 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 23 ways as a sum of consecutive naturals, for example, 573316 + ... + 2081517.
It is an arithmetic number, because the mean of its divisors is an integer number (125764796248).
Almost surely, 22002012220133 is an apocalyptic number.
2002012220133 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2002012220133 is a deficient number, since it is larger than the sum of its proper divisors (1016342889819).
2002012220133 is a wasteful number, since it uses less digits than its factorization.
2002012220133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2658505 (or 2658502 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 2002012220133 its reverse (3310222102002), we get a palindrome (5312234322135).
The spelling of 2002012220133 in words is "two trillion, two billion, twelve million, two hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •