Base | Representation |
---|---|
bin | 111010000011… |
… | …0101111100001 |
3 | 2010021022210011 |
4 | 1310012233201 |
5 | 30242430241 |
6 | 3004204521 |
7 | 516463426 |
oct | 164065741 |
9 | 63238704 |
10 | 30436321 |
11 | 161a9293 |
12 | a239741 |
13 | 63c8776 |
14 | 4083d4d |
15 | 2a13281 |
hex | 1d06be1 |
30436321 has 2 divisors, whose sum is σ = 30436322. Its totient is φ = 30436320.
The previous prime is 30436319. The next prime is 30436339. The reversal of 30436321 is 12363403.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22090000 + 8346321 = 4700^2 + 2889^2 .
It is a cyclic number.
It is not a de Polignac number, because 30436321 - 21 = 30436319 is a prime.
Together with 30436319, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 30436292 and 30436301.
It is not a weakly prime, because it can be changed into another prime (30436381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15218160 + 15218161.
It is an arithmetic number, because the mean of its divisors is an integer number (15218161).
Almost surely, 230436321 is an apocalyptic number.
It is an amenable number.
30436321 is a deficient number, since it is larger than the sum of its proper divisors (1).
30436321 is an equidigital number, since it uses as much as digits as its factorization.
30436321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 22.
The square root of 30436321 is about 5516.9122704643. The cubic root of 30436321 is about 312.2223958146. Note that the first 3 decimals are identical.
Adding to 30436321 its reverse (12363403), we get a palindrome (42799724).
The spelling of 30436321 in words is "thirty million, four hundred thirty-six thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •