Base | Representation |
---|---|
bin | 111011100111111… |
… | …0001110100101100 |
3 | 12011102112021111000 |
4 | 1313033301310230 |
5 | 13044124444230 |
6 | 530304200300 |
7 | 100402013526 |
oct | 16717616454 |
9 | 5142467430 |
10 | 2000624940 |
11 | 937334146 |
12 | 47a009090 |
13 | 25b635952 |
14 | 14d9bca16 |
15 | ba987b60 |
hex | 773f1d2c |
2000624940 has 96 divisors (see below), whose sum is σ = 6590324160. Its totient is φ = 502115328.
The previous prime is 2000624921. The next prime is 2000624947. The reversal of 2000624940 is 494260002.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (2000624947) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 99787 + ... + 118146.
It is an arithmetic number, because the mean of its divisors is an integer number (68649210).
Almost surely, 22000624940 is an apocalyptic number.
2000624940 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2000624940 is an abundant number, since it is smaller than the sum of its proper divisors (4589699220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000624940 is a wasteful number, since it uses less digits than its factorization.
2000624940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217968 (or 217960 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
The square root of 2000624940 is about 44728.3460458801. The cubic root of 2000624940 is about 1260.0522654057.
Adding to 2000624940 its reverse (494260002), we get a palindrome (2494884942).
The spelling of 2000624940 in words is "two billion, six hundred twenty-four thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •