Base | Representation |
---|---|
bin | 11000000101010… |
… | …11101111001110 |
3 | 112002011012002201 |
4 | 30002223233032 |
5 | 403204430110 |
6 | 32014112114 |
7 | 5002140556 |
oct | 1402535716 |
9 | 462135081 |
10 | 202030030 |
11 | a404a174 |
12 | 577ab63a |
13 | 32b182c7 |
14 | 1cb90166 |
15 | 12b0ab3a |
hex | c0abbce |
202030030 has 8 divisors (see below), whose sum is σ = 363654072. Its totient is φ = 80812008.
The previous prime is 202030009. The next prime is 202030033. The reversal of 202030030 is 30030202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2020300302 = 81632266043601800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 20203003 = 202030030 / (2 + 0 + 2 + 0 + 3 + 0 + 0 + 3 + 0).
It is a junction number, because it is equal to n+sod(n) for n = 202029989 and 202030016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202030033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10101492 + ... + 10101511.
It is an arithmetic number, because the mean of its divisors is an integer number (45456759).
Almost surely, 2202030030 is an apocalyptic number.
202030030 is a deficient number, since it is larger than the sum of its proper divisors (161624042).
202030030 is a wasteful number, since it uses less digits than its factorization.
202030030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20203010.
The product of its (nonzero) digits is 36, while the sum is 10.
The square root of 202030030 is about 14213.7268160043. The cubic root of 202030030 is about 586.7755053034.
Adding to 202030030 its reverse (30030202), we get a palindrome (232060232).
The spelling of 202030030 in words is "two hundred two million, thirty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •