Base | Representation |
---|---|
bin | 11101001000100111000… |
… | …111011110110000000001 |
3 | 21002101210120010101220100 |
4 | 131020213013132300001 |
5 | 230300310411013241 |
6 | 4131431311433013 |
7 | 264435114661161 |
oct | 35104707366001 |
9 | 7071716111810 |
10 | 2002111032321 |
11 | 7020aa5346a4 |
12 | 284032b25769 |
13 | 116a4ba1591a |
14 | 6cc8cdac5a1 |
15 | 3712d4c39b6 |
hex | 1d2271dec01 |
2002111032321 has 24 divisors (see below), whose sum is σ = 3052868000000. Its totient is φ = 1260867956832.
The previous prime is 2002111032301. The next prime is 2002111032331. The reversal of 2002111032321 is 1232301112002.
2002111032321 is a `hidden beast` number, since 200 + 2 + 1 + 110 + 32 + 321 = 666.
It is not a de Polignac number, because 2002111032321 - 219 = 2002110508033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2002111032294 and 2002111032303.
It is not an unprimeable number, because it can be changed into a prime (2002111032301) 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, 16714321 + ... + 16833678.
Almost surely, 22002111032321 is an apocalyptic number.
It is an amenable number.
2002111032321 is a deficient number, since it is larger than the sum of its proper divisors (1050756967679).
2002111032321 is a wasteful number, since it uses less digits than its factorization.
2002111032321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33548373 (or 33548370 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 2002111032321 its reverse (1232301112002), we get a palindrome (3234412144323).
The spelling of 2002111032321 in words is "two trillion, two billion, one hundred eleven million, thirty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •