Base | Representation |
---|---|
bin | 10010001011011… |
… | …010000100010001 |
3 | 210020212121020111 |
4 | 102023122010101 |
5 | 1111033331431 |
6 | 50132441321 |
7 | 10362201136 |
oct | 2213320421 |
9 | 706777214 |
10 | 304980241 |
11 | 147176195 |
12 | 86179241 |
13 | 4b2528a7 |
14 | 2c70c58d |
15 | 1bb947b1 |
hex | 122da111 |
304980241 has 2 divisors, whose sum is σ = 304980242. Its totient is φ = 304980240.
The previous prime is 304980239. The next prime is 304980283. The reversal of 304980241 is 142089403.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 187799616 + 117180625 = 13704^2 + 10825^2 .
It is an emirp because it is prime and its reverse (142089403) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 304980241 - 21 = 304980239 is a prime.
It is a super-3 number, since 3×3049802413 (a number of 26 digits) contains 333 as substring.
Together with 304980239, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (304983241) 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, 152490120 + 152490121.
It is an arithmetic number, because the mean of its divisors is an integer number (152490121).
Almost surely, 2304980241 is an apocalyptic number.
It is an amenable number.
304980241 is a deficient number, since it is larger than the sum of its proper divisors (1).
304980241 is an equidigital number, since it uses as much as digits as its factorization.
304980241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 31.
The square root of 304980241 is about 17463.6834888863. The cubic root of 304980241 is about 673.1170134495.
The spelling of 304980241 in words is "three hundred four million, nine hundred eighty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •