Base | Representation |
---|---|
bin | 11100001000101010… |
… | …011001001111001101 |
3 | 2212222101122012102212 |
4 | 130020222121033031 |
5 | 443332241232341 |
6 | 21513415200205 |
7 | 2116430426525 |
oct | 341052311715 |
9 | 85871565385 |
10 | 30210102221 |
11 | 118a28a6a32 |
12 | 5a31376065 |
13 | 2b05a78640 |
14 | 16682da685 |
15 | bbc2cb5eb |
hex | 708a993cd |
30210102221 has 8 divisors (see below), whose sum is σ = 32632250784. Its totient is φ = 27801995760.
The previous prime is 30210102199. The next prime is 30210102271. The reversal of 30210102221 is 12220101203.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30210102221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30210102196 and 30210102205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30210102271) 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 7 ways as a sum of consecutive naturals, for example, 3506051 + ... + 3514656.
It is an arithmetic number, because the mean of its divisors is an integer number (4079031348).
Almost surely, 230210102221 is an apocalyptic number.
It is an amenable number.
30210102221 is a deficient number, since it is larger than the sum of its proper divisors (2422148563).
30210102221 is a wasteful number, since it uses less digits than its factorization.
30210102221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7021051.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 30210102221 its reverse (12220101203), we get a palindrome (42430203424).
The spelling of 30210102221 in words is "thirty billion, two hundred ten million, one hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •