Base | Representation |
---|---|
bin | 11101001000110100001… |
… | …110101011001100110011 |
3 | 21002102100220002001012002 |
4 | 131020310032223030303 |
5 | 230301233220202011 |
6 | 4131505210524215 |
7 | 264443425602656 |
oct | 35106416531463 |
9 | 7072326061162 |
10 | 2002331022131 |
11 | 702202730260 |
12 | 28409473666b |
13 | 116a8547b7cb |
14 | 6ccb02b589d |
15 | 3714297ac3b |
hex | 1d2343ab333 |
2002331022131 has 8 divisors (see below), whose sum is σ = 2184581854128. Its totient is φ = 1820116980000.
The previous prime is 2002331022113. The next prime is 2002331022143. The reversal of 2002331022131 is 1312201332002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-2002331022131 is a prime.
It is a super-2 number, since 2×20023310221312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2002331022191) 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, 9083600 + ... + 9301421.
It is an arithmetic number, because the mean of its divisors is an integer number (273072731766).
Almost surely, 22002331022131 is an apocalyptic number.
2002331022131 is a deficient number, since it is larger than the sum of its proper divisors (182250831997).
2002331022131 is a wasteful number, since it uses less digits than its factorization.
2002331022131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18394933.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 2002331022131 its reverse (1312201332002), we get a palindrome (3314532354133).
The spelling of 2002331022131 in words is "two trillion, two billion, three hundred thirty-one million, twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •