Base | Representation |
---|---|
bin | 11101001000101100011… |
… | …111111001101011000011 |
3 | 21002102000212000111111022 |
4 | 131020230133321223003 |
5 | 230301002014221011 |
6 | 4131444254540055 |
7 | 264440262263015 |
oct | 35105437715303 |
9 | 7072025014438 |
10 | 2002201320131 |
11 | 7021464a2221 |
12 | 28405920762b |
13 | 116a6463886c |
14 | 6cc9ad921b5 |
15 | 371363aa8db |
hex | 1d22c7f9ac3 |
2002201320131 has 64 divisors (see below), whose sum is σ = 2294557009920. Its totient is φ = 1735646330880.
The previous prime is 2002201320127. The next prime is 2002201320143. The reversal of 2002201320131 is 1310231022002.
It is a cyclic number.
It is not a de Polignac number, because 2002201320131 - 22 = 2002201320127 is a prime.
It is a super-2 number, since 2×20022013201312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is not an unprimeable number, because it can be changed into a prime (2002201320151) 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 63 ways as a sum of consecutive naturals, for example, 904744181 + ... + 904746393.
It is an arithmetic number, because the mean of its divisors is an integer number (35852453280).
Almost surely, 22002201320131 is an apocalyptic number.
2002201320131 is a deficient number, since it is larger than the sum of its proper divisors (292355689789).
2002201320131 is a wasteful number, since it uses less digits than its factorization.
2002201320131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2844.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 2002201320131 its reverse (1310231022002), we get a palindrome (3312432342133).
The spelling of 2002201320131 in words is "two trillion, two billion, two hundred one million, three hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.390 sec. • engine limits •