Base | Representation |
---|---|
bin | 11101000110101111010… |
… | …111101101100000000001 |
3 | 21002012121112211001122010 |
4 | 131012233113231200001 |
5 | 230232202104133441 |
6 | 4130500103403133 |
7 | 264334251445521 |
oct | 35065727554001 |
9 | 7065545731563 |
10 | 2000102021121 |
11 | 7012694a2866 |
12 | 2837721534a9 |
13 | 1167bb734ab9 |
14 | 6cb3c249681 |
15 | 37061e31116 |
hex | 1d1af5ed801 |
2000102021121 has 4 divisors (see below), whose sum is σ = 2666802694832. Its totient is φ = 1333401347412.
The previous prime is 2000102021101. The next prime is 2000102021149. The reversal of 2000102021121 is 1211202010002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 2000102021121 - 25 = 2000102021089 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2000102021097 and 2000102021106.
It is not an unprimeable number, because it can be changed into a prime (2000102021101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 333350336851 + ... + 333350336856.
It is an arithmetic number, because the mean of its divisors is an integer number (666700673708).
Almost surely, 22000102021121 is an apocalyptic number.
It is an amenable number.
2000102021121 is a deficient number, since it is larger than the sum of its proper divisors (666700673711).
2000102021121 is an equidigital number, since it uses as much as digits as its factorization.
2000102021121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 666700673710.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2000102021121 its reverse (1211202010002), we get a palindrome (3211304031123).
The spelling of 2000102021121 in words is "two trillion, one hundred two million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •