Base | Representation |
---|---|
bin | 111011101010111… |
… | …0101000010111001 |
3 | 12011112111212011000 |
4 | 1313111311002321 |
5 | 13100031223001 |
6 | 530402155213 |
7 | 100421340600 |
oct | 16725650271 |
9 | 5145455130 |
10 | 2002211001 |
11 | 93821783a |
12 | 47a652b09 |
13 | 25ba6c84b |
14 | 14dcb2a37 |
15 | bab9ca86 |
hex | 775750b9 |
2002211001 has 24 divisors (see below), whose sum is σ = 3450524640. Its totient is φ = 1144119816.
The previous prime is 2002210999. The next prime is 2002211009. The reversal of 2002211001 is 1001122002.
It is not a de Polignac number, because 2002211001 - 21 = 2002210999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2002211009) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 755371 + ... + 758016.
It is an arithmetic number, because the mean of its divisors is an integer number (143771860).
Almost surely, 22002211001 is an apocalyptic number.
2002211001 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2002211001 is a deficient number, since it is larger than the sum of its proper divisors (1448313639).
2002211001 is a wasteful number, since it uses less digits than its factorization.
2002211001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1513410 (or 1513397 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 2002211001 is about 44746.0724645192. The cubic root of 2002211001 is about 1260.3851600291.
Adding to 2002211001 its reverse (1001122002), we get a palindrome (3003333003).
It can be divided in two parts, 20022 and 11001, that multiplied together give a palindrome (220262022).
The spelling of 2002211001 in words is "two billion, two million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •