Base | Representation |
---|---|
bin | 111011100111101… |
… | …1010001111001010 |
3 | 12011102100100221212 |
4 | 1313033122033022 |
5 | 13044113401310 |
6 | 530302133122 |
7 | 100401132053 |
oct | 16717321712 |
9 | 5142310855 |
10 | 2000528330 |
11 | 9372785a9 |
12 | 479b811a2 |
13 | 25b600998 |
14 | 14d99572a |
15 | ba969205 |
hex | 773da3ca |
2000528330 has 8 divisors (see below), whose sum is σ = 3600951012. Its totient is φ = 800211328.
The previous prime is 2000528303. The next prime is 2000528357. The reversal of 2000528330 is 338250002.
It is an interprime number because it is at equal distance from previous prime (2000528303) and next prime (2000528357).
It can be written as a sum of positive squares in 2 ways, for example, as 1985682721 + 14845609 = 44561^2 + 3853^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×20005283302 = 8004227198265177800, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2000528296 and 2000528305.
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 3 ways as a sum of consecutive naturals, for example, 100026407 + ... + 100026426.
Almost surely, 22000528330 is an apocalyptic number.
2000528330 is a deficient number, since it is larger than the sum of its proper divisors (1600422682).
2000528330 is a wasteful number, since it uses less digits than its factorization.
2000528330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200052840.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 2000528330 is about 44727.2660689204. The cubic root of 2000528330 is about 1260.0319824753.
Adding to 2000528330 its reverse (338250002), we get a palindrome (2338778332).
The spelling of 2000528330 in words is "two billion, five hundred twenty-eight thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •