Base | Representation |
---|---|
bin | 111011100111010… |
… | …0111100111101000 |
3 | 12011101221211112222 |
4 | 1313032213213220 |
5 | 13044040233000 |
6 | 530253453212 |
7 | 100366306436 |
oct | 16716474750 |
9 | 5141854488 |
10 | 2000321000 |
11 | 937146857 |
12 | 479aa1208 |
13 | 25b55a4c2 |
14 | 14d93dd56 |
15 | ba927a85 |
hex | 773a79e8 |
2000321000 has 32 divisors (see below), whose sum is σ = 4680753480. Its totient is φ = 800128000.
The previous prime is 2000320981. The next prime is 2000321003. The reversal of 2000321000 is 1230002.
It can be written as a sum of positive squares in 4 ways, for example, as 158709604 + 1841611396 = 12598^2 + 42914^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
It is not an unprimeable number, because it can be changed into a prime (2000321003) 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 7 ways as a sum of consecutive naturals, for example, 999161 + ... + 1001160.
Almost surely, 22000321000 is an apocalyptic number.
2000321000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2000321000 is an abundant number, since it is smaller than the sum of its proper divisors (2680432480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000321000 is a wasteful number, since it uses less digits than its factorization.
2000321000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2000342 (or 2000328 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 8.
The square root of 2000321000 is about 44724.9482951071. The cubic root of 2000321000 is about 1259.9884520652.
Adding to 2000321000 its reverse (1230002), we get a palindrome (2001551002).
The spelling of 2000321000 in words is "two billion, three hundred twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •