Base | Representation |
---|---|
bin | 11101000111100101100… |
… | …011100101000110101001 |
3 | 21002021221220102011022210 |
4 | 131013211203211012221 |
5 | 230241032320231441 |
6 | 4131130220235333 |
7 | 264365630505453 |
oct | 35074543450651 |
9 | 7067856364283 |
10 | 2001011102121 |
11 | 701695667879 |
12 | 28398669bb49 |
13 | 116904b8a955 |
14 | 6cbc6c8b2d3 |
15 | 370b6b53616 |
hex | 1d1e58e51a9 |
2001011102121 has 8 divisors (see below), whose sum is σ = 2668033957600. Its totient is φ = 1333997824032.
The previous prime is 2001011102119. The next prime is 2001011102159. The reversal of 2001011102121 is 1212011101002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2001011102121 - 21 = 2001011102119 is a prime.
It is a super-2 number, since 2×20010111021212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2001011102097 and 2001011102106.
It is not an unprimeable number, because it can be changed into a prime (2001011103121) 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, 1891771 + ... + 2753328.
It is an arithmetic number, because the mean of its divisors is an integer number (333504244700).
Almost surely, 22001011102121 is an apocalyptic number.
It is an amenable number.
2001011102121 is a deficient number, since it is larger than the sum of its proper divisors (667022855479).
2001011102121 is a wasteful number, since it uses less digits than its factorization.
2001011102121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4788695.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 2001011102121 its reverse (1212011101002), we get a palindrome (3213022203123).
The spelling of 2001011102121 in words is "two trillion, one billion, eleven million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •