Base | Representation |
---|---|
bin | 11011111100010010… |
… | …001010100110001010 |
3 | 2212102220212001202101 |
4 | 123330102022212022 |
5 | 442421110033302 |
6 | 21441040024014 |
7 | 2111326253332 |
oct | 337422124612 |
9 | 85386761671 |
10 | 30002424202 |
11 | 117a664a403 |
12 | 599390200a |
13 | 2aa1a3363a |
14 | 16488ba0c2 |
15 | ba8e57287 |
hex | 6fc48a98a |
30002424202 has 8 divisors (see below), whose sum is σ = 47372248800. Its totient is φ = 14211674604.
The previous prime is 30002424187. The next prime is 30002424203. The reversal of 30002424202 is 20242420003.
30002424202 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 30002424202.
It is not an unprimeable number, because it can be changed into a prime (30002424203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 394768702 + ... + 394768777.
It is an arithmetic number, because the mean of its divisors is an integer number (5921531100).
Almost surely, 230002424202 is an apocalyptic number.
30002424202 is a deficient number, since it is larger than the sum of its proper divisors (17369824598).
30002424202 is a wasteful number, since it uses less digits than its factorization.
30002424202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 789537500.
The product of its (nonzero) digits is 768, while the sum is 19.
Adding to 30002424202 its reverse (20242420003), we get a palindrome (50244844205).
The spelling of 30002424202 in words is "thirty billion, two million, four hundred twenty-four thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •