Base | Representation |
---|---|
bin | 111011101010101… |
… | …1010001110000001 |
3 | 12011112022021102101 |
4 | 1313111122032001 |
5 | 13100014213441 |
6 | 530355550401 |
7 | 100420402336 |
oct | 16725321601 |
9 | 5145267371 |
10 | 2002101121 |
11 | 938152229 |
12 | 47a5bb401 |
13 | 25ba31827 |
14 | 14dc8498d |
15 | bab7a231 |
hex | 7755a381 |
2002101121 has 4 divisors (see below), whose sum is σ = 2002544644. Its totient is φ = 2001657600.
The previous prime is 2002101119. The next prime is 2002101131. The reversal of 2002101121 is 1211012002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 744689521 + 1257411600 = 27289^2 + 35460^2 .
It is a cyclic number.
It is not a de Polignac number, because 2002101121 - 21 = 2002101119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2002101098 and 2002101107.
It is not an unprimeable number, because it can be changed into a prime (2002101131) 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, 214920 + ... + 224041.
It is an arithmetic number, because the mean of its divisors is an integer number (500636161).
Almost surely, 22002101121 is an apocalyptic number.
It is an amenable number.
2002101121 is a deficient number, since it is larger than the sum of its proper divisors (443523).
2002101121 is an equidigital number, since it uses as much as digits as its factorization.
2002101121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 443522.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 2002101121 is about 44744.8446304152. The cubic root of 2002101121 is about 1260.3621032425.
Adding to 2002101121 its reverse (1211012002), we get a palindrome (3213113123).
The spelling of 2002101121 in words is "two billion, two million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •