Base | Representation |
---|---|
bin | 111010011100… |
… | …1010001000111 |
3 | 2010122211122222 |
4 | 1310321101013 |
5 | 30321041041 |
6 | 3012442555 |
7 | 521314661 |
oct | 164712107 |
9 | 63584588 |
10 | 30643271 |
11 | 1632a81a |
12 | a31945b |
13 | 646ba19 |
14 | 40d9531 |
15 | 2a5474b |
hex | 1d39447 |
30643271 has 2 divisors, whose sum is σ = 30643272. Its totient is φ = 30643270.
The previous prime is 30643267. The next prime is 30643297. The reversal of 30643271 is 17234603.
It is an a-pointer prime, because the next prime (30643297) can be obtained adding 30643271 to its sum of digits (26).
It is a weak prime.
It is an emirp because it is prime and its reverse (17234603) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30643271 - 22 = 30643267 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30643271.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30643241) 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, 15321635 + 15321636.
It is an arithmetic number, because the mean of its divisors is an integer number (15321636).
Almost surely, 230643271 is an apocalyptic number.
30643271 is a deficient number, since it is larger than the sum of its proper divisors (1).
30643271 is an equidigital number, since it uses as much as digits as its factorization.
30643271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 26.
The square root of 30643271 is about 5535.6364584391. The cubic root of 30643271 is about 312.9284440059.
Adding to 30643271 its reverse (17234603), we get a palindrome (47877874).
The spelling of 30643271 in words is "thirty million, six hundred forty-three thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •