Base | Representation |
---|---|
bin | 111011100110101… |
… | …1110001101001110 |
3 | 12011101101120002000 |
4 | 1313031132031032 |
5 | 13044001122202 |
6 | 530243213130 |
7 | 100363614660 |
oct | 16715361516 |
9 | 5141346060 |
10 | 2000020302 |
11 | 936a60945 |
12 | 4799771a6 |
13 | 25b483687 |
14 | 14d8a2530 |
15 | ba8b891c |
hex | 7735e34e |
2000020302 has 64 divisors (see below), whose sum is σ = 5131875840. Its totient is φ = 565532928.
The previous prime is 2000020279. The next prime is 2000020339. The reversal of 2000020302 is 2030200002.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
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, 9393 + ... + 63939.
It is an arithmetic number, because the mean of its divisors is an integer number (80185560).
Almost surely, 22000020302 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2000020302, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2565937920).
2000020302 is an abundant number, since it is smaller than the sum of its proper divisors (3131855538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000020302 is a wasteful number, since it uses less digits than its factorization.
2000020302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54662 (or 54656 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 9.
The square root of 2000020302 is about 44721.5865326802. The cubic root of 2000020302 is about 1259.9253130333.
Adding to 2000020302 its reverse (2030200002), we get a palindrome (4030220304).
The spelling of 2000020302 in words is "two billion, twenty thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •