Base | Representation |
---|---|
bin | 111001110011… |
… | …1111101001101 |
3 | 2010000220210210 |
4 | 1303213331031 |
5 | 30224411341 |
6 | 3001353033 |
7 | 515426664 |
oct | 163477515 |
9 | 63026723 |
10 | 30310221 |
11 | 16122577 |
12 | a198779 |
13 | 6383256 |
14 | 404dddb |
15 | 29dac16 |
hex | 1ce7f4d |
30310221 has 4 divisors (see below), whose sum is σ = 40413632. Its totient is φ = 20206812.
The previous prime is 30310213. The next prime is 30310261. The reversal of 30310221 is 12201303.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 30310221 - 23 = 30310213 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30310197 and 30310206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30310261) 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, 5051701 + ... + 5051706.
It is an arithmetic number, because the mean of its divisors is an integer number (10103408).
Almost surely, 230310221 is an apocalyptic number.
It is an amenable number.
30310221 is a deficient number, since it is larger than the sum of its proper divisors (10103411).
30310221 is a wasteful number, since it uses less digits than its factorization.
30310221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10103410.
The product of its (nonzero) digits is 36, while the sum is 12.
The square root of 30310221 is about 5505.4719143775. The cubic root of 30310221 is about 311.7906118911.
Adding to 30310221 its reverse (12201303), we get a palindrome (42511524).
The spelling of 30310221 in words is "thirty million, three hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •