Base | Representation |
---|---|
bin | 11101000111101100110… |
… | …001010001001100111011 |
3 | 21002022021100011001220201 |
4 | 131013230301101030323 |
5 | 230241304311144011 |
6 | 4131150222303031 |
7 | 264401630313640 |
oct | 35075461211473 |
9 | 7068240131821 |
10 | 2001132131131 |
11 | 701747a11751 |
12 | 2839bb127a77 |
13 | 116923c85053 |
14 | 6cbd8d93dc7 |
15 | 370c25adcc1 |
hex | 1d1ecc5133b |
2001132131131 has 8 divisors (see below), whose sum is σ = 2287017460224. Its totient is φ = 1715249129640.
The previous prime is 2001132131099. The next prime is 2001132131213. The reversal of 2001132131131 is 1311312311002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2001132131131 - 25 = 2001132131099 is a prime.
It is a super-2 number, since 2×20011321311312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2001132131099 and 2001132131108.
It is not an unprimeable number, because it can be changed into a prime (2001132101131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2060136 + ... + 2871658.
It is an arithmetic number, because the mean of its divisors is an integer number (285877182528).
Almost surely, 22001132131131 is an apocalyptic number.
2001132131131 is a deficient number, since it is larger than the sum of its proper divisors (285885329093).
2001132131131 is an equidigital number, since it uses as much as digits as its factorization.
2001132131131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1163801.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 2001132131131 its reverse (1311312311002), we get a palindrome (3312444442133).
The spelling of 2001132131131 in words is "two trillion, one billion, one hundred thirty-two million, one hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •