Base | Representation |
---|---|
bin | 11101000111101100000… |
… | …011000100011010011001 |
3 | 21002022020111100202201210 |
4 | 131013230003010122121 |
5 | 230241243211120441 |
6 | 4131145110533333 |
7 | 264401422342605 |
oct | 35075403043231 |
9 | 7068214322653 |
10 | 2001120020121 |
11 | 70174109a552 |
12 | 2839b7067249 |
13 | 116921604681 |
14 | 6cbd7520505 |
15 | 370c14ba616 |
hex | 1d1ec0c4699 |
2001120020121 has 8 divisors (see below), whose sum is σ = 2670217210144. Its totient is φ = 1333051421760.
The previous prime is 2001120020111. The next prime is 2001120020167. The reversal of 2001120020121 is 1210200211002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2001120020121 - 29 = 2001120019609 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2001120020097 and 2001120020106.
It is not an unprimeable number, because it can be changed into a prime (2001120020111) 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 7 ways as a sum of consecutive naturals, for example, 257143375 + ... + 257151156.
It is an arithmetic number, because the mean of its divisors is an integer number (333777151268).
Almost surely, 22001120020121 is an apocalyptic number.
It is an amenable number.
2001120020121 is a deficient number, since it is larger than the sum of its proper divisors (669097190023).
2001120020121 is a wasteful number, since it uses less digits than its factorization.
2001120020121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 514295831.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2001120020121 its reverse (1210200211002), we get a palindrome (3211320231123).
The spelling of 2001120020121 in words is "two trillion, one billion, one hundred twenty million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •