Base | Representation |
---|---|
bin | 111011101010111… |
… | …0001000011010000 |
3 | 12011112111000201001 |
4 | 1313111301003100 |
5 | 13100030212030 |
6 | 530401551344 |
7 | 100421242105 |
oct | 16725610320 |
9 | 5145430631 |
10 | 2002194640 |
11 | 938206516 |
12 | 47a645554 |
13 | 25ba65274 |
14 | 14dcaaaac |
15 | bab97cca |
hex | 775710d0 |
2002194640 has 40 divisors (see below), whose sum is σ = 4657503240. Its totient is φ = 800464896.
The previous prime is 2002194629. The next prime is 2002194659. The reversal of 2002194640 is 464912002.
It can be written as a sum of positive squares in 4 ways, for example, as 356756544 + 1645438096 = 18888^2 + 40564^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a junction number, because it is equal to n+sod(n) for n = 2002194599 and 2002194608.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 184896 + ... + 195424.
It is an arithmetic number, because the mean of its divisors is an integer number (116437581).
Almost surely, 22002194640 is an apocalyptic number.
2002194640 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2002194640 is an abundant number, since it is smaller than the sum of its proper divisors (2655308600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002194640 is a wasteful number, since it uses less digits than its factorization.
2002194640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12919 (or 12913 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 28.
The square root of 2002194640 is about 44745.8896436310. The cubic root of 2002194640 is about 1260.3817269547.
The spelling of 2002194640 in words is "two billion, two million, one hundred ninety-four thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •