Base | Representation |
---|---|
bin | 111010100000… |
… | …0100101011001 |
3 | 2010201100202222 |
4 | 1311000211121 |
5 | 30323020431 |
6 | 3013233425 |
7 | 521501234 |
oct | 165004531 |
9 | 63640688 |
10 | 30673241 |
11 | 16350295 |
12 | a332875 |
13 | 647c561 |
14 | 410641b |
15 | 2a5d57b |
hex | 1d40959 |
30673241 has 2 divisors, whose sum is σ = 30673242. Its totient is φ = 30673240.
The previous prime is 30673211. The next prime is 30673309. The reversal of 30673241 is 14237603.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 25290841 + 5382400 = 5029^2 + 2320^2 .
It is an emirp because it is prime and its reverse (14237603) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30673241 - 210 = 30672217 is a prime.
It is a Chen prime.
It is equal to p1897100 and since 30673241 and 1897100 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30673241.
It is not a weakly prime, because it can be changed into another prime (30673211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15336620 + 15336621.
It is an arithmetic number, because the mean of its divisors is an integer number (15336621).
Almost surely, 230673241 is an apocalyptic number.
It is an amenable number.
30673241 is a deficient number, since it is larger than the sum of its proper divisors (1).
30673241 is an equidigital number, since it uses as much as digits as its factorization.
30673241 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 30673241 is about 5538.3428026802. The cubic root of 30673241 is about 313.0304284368.
The spelling of 30673241 in words is "thirty million, six hundred seventy-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •