Base | Representation |
---|---|
bin | 11101001000100001001… |
… | …010101010001001010011 |
3 | 21002101112121021111121220 |
4 | 131020201022222021103 |
5 | 230300104331432011 |
6 | 4131413344020123 |
7 | 264432463304103 |
oct | 35104112521123 |
9 | 7071477244556 |
10 | 2002011202131 |
11 | 702059149806 |
12 | 284005601643 |
13 | 116a341314c5 |
14 | 6cc7da23203 |
15 | 37124854506 |
hex | 1d2212aa253 |
2002011202131 has 16 divisors (see below), whose sum is σ = 2761588663200. Its totient is φ = 1288560401408.
The previous prime is 2002011202123. The next prime is 2002011202187. The reversal of 2002011202131 is 1312021102002.
It is a cyclic number.
It is not a de Polignac number, because 2002011202131 - 23 = 2002011202123 is a prime.
It is a super-2 number, since 2×20020112021312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2002011202131.
It is not an unprimeable number, because it can be changed into a prime (2002011202231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 449365 + ... + 2050841.
It is an arithmetic number, because the mean of its divisors is an integer number (172599291450).
Almost surely, 22002011202131 is an apocalyptic number.
2002011202131 is a deficient number, since it is larger than the sum of its proper divisors (759577461069).
2002011202131 is a wasteful number, since it uses less digits than its factorization.
2002011202131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1615878.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 2002011202131 its reverse (1312021102002), we get a palindrome (3314032304133).
The spelling of 2002011202131 in words is "two trillion, two billion, eleven million, two hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •