Base | Representation |
---|---|
bin | 111011101010101… |
… | …1010001111100100 |
3 | 12011112022021120001 |
4 | 1313111122033210 |
5 | 13100014214340 |
6 | 530355551044 |
7 | 100420402540 |
oct | 16725321744 |
9 | 5145267501 |
10 | 2002101220 |
11 | 938152309 |
12 | 47a5bb484 |
13 | 25ba318a2 |
14 | 14dc84a20 |
15 | bab7a29a |
hex | 7755a3e4 |
2002101220 has 48 divisors (see below), whose sum is σ = 5087698560. Its totient is φ = 646055424.
The previous prime is 2002101181. The next prime is 2002101223. The reversal of 2002101220 is 221012002.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 2002101197 and 2002101206.
It is not an unprimeable number, because it can be changed into a prime (2002101223) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 418230 + ... + 422989.
It is an arithmetic number, because the mean of its divisors is an integer number (105993720).
Almost surely, 22002101220 is an apocalyptic number.
2002101220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2002101220 is an abundant number, since it is smaller than the sum of its proper divisors (3085597340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002101220 is a wasteful number, since it uses less digits than its factorization.
2002101220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 841252 (or 841250 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
The square root of 2002101220 is about 44744.8457366879. The cubic root of 2002101220 is about 1260.3621240167.
Adding to 2002101220 its reverse (221012002), we get a palindrome (2223113222).
The spelling of 2002101220 in words is "two billion, two million, one hundred one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •