Base | Representation |
---|---|
bin | 111001100111… |
… | …1101110111010 |
3 | 2002211212201000 |
4 | 1303033232322 |
5 | 30213223002 |
6 | 2555305430 |
7 | 514534503 |
oct | 163175672 |
9 | 62755630 |
10 | 30211002 |
11 | 16064a78 |
12 | a14b276 |
13 | 634a043 |
14 | 4025baa |
15 | 29bb61c |
hex | 1ccfbba |
30211002 has 32 divisors (see below), whose sum is σ = 67743360. Its totient is φ = 9979200.
The previous prime is 30211001. The next prime is 30211031. The reversal of 30211002 is 20011203.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (30211001) 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 15 ways as a sum of consecutive naturals, for example, 3627 + ... + 8577.
It is an arithmetic number, because the mean of its divisors is an integer number (2116980).
Almost surely, 230211002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30211002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33871680).
30211002 is an abundant number, since it is smaller than the sum of its proper divisors (37532358).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30211002 is a wasteful number, since it uses less digits than its factorization.
30211002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5075 (or 5069 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
The square root of 30211002 is about 5496.4535839030. The cubic root of 30211002 is about 311.4500296436.
Adding to 30211002 its reverse (20011203), we get a palindrome (50222205).
The spelling of 30211002 in words is "thirty million, two hundred eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •