Base | Representation |
---|---|
bin | 111001101001… |
… | …1011111110101 |
3 | 2002212122212002 |
4 | 1303103133311 |
5 | 30214221141 |
6 | 2555505045 |
7 | 514630451 |
oct | 163233765 |
9 | 62778762 |
10 | 30226421 |
11 | 16075615 |
12 | a158185 |
13 | 6354074 |
14 | 402b661 |
15 | 29c0e9b |
hex | 1cd37f5 |
30226421 has 2 divisors, whose sum is σ = 30226422. Its totient is φ = 30226420.
The previous prime is 30226409. The next prime is 30226423. The reversal of 30226421 is 12462203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16313521 + 13912900 = 4039^2 + 3730^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30226421 is a prime.
Together with 30226423, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 30226393 and 30226402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30226423) 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 as a sum of consecutive naturals, namely, 15113210 + 15113211.
It is an arithmetic number, because the mean of its divisors is an integer number (15113211).
Almost surely, 230226421 is an apocalyptic number.
It is an amenable number.
30226421 is a deficient number, since it is larger than the sum of its proper divisors (1).
30226421 is an equidigital number, since it uses as much as digits as its factorization.
30226421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 20.
The square root of 30226421 is about 5497.8560366747. The cubic root of 30226421 is about 311.5030062739.
Adding to 30226421 its reverse (12462203), we get a palindrome (42688624).
The spelling of 30226421 in words is "thirty million, two hundred twenty-six thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •