Base | Representation |
---|---|
bin | 10010001000110… |
… | …100000011000111 |
3 | 210012121001102221 |
4 | 102020310003013 |
5 | 1110400101411 |
6 | 50110113211 |
7 | 10353336454 |
oct | 2210640307 |
9 | 705531387 |
10 | 304300231 |
11 | 1468512a4 |
12 | 85aab807 |
13 | 4b075211 |
14 | 2c5b282b |
15 | 1baad071 |
hex | 122340c7 |
304300231 has 4 divisors (see below), whose sum is σ = 310774752. Its totient is φ = 297825712.
The previous prime is 304300211. The next prime is 304300273. The reversal of 304300231 is 132003403.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 304300231 - 213 = 304292039 is a prime.
It is a super-3 number, since 3×3043002313 (a number of 26 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (304300211) 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 in 3 ways as a sum of consecutive naturals, for example, 3237190 + ... + 3237283.
It is an arithmetic number, because the mean of its divisors is an integer number (77693688).
Almost surely, 2304300231 is an apocalyptic number.
304300231 is a deficient number, since it is larger than the sum of its proper divisors (6474521).
304300231 is an equidigital number, since it uses as much as digits as its factorization.
304300231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6474520.
The product of its (nonzero) digits is 216, while the sum is 16.
The square root of 304300231 is about 17444.2033638685. The cubic root of 304300231 is about 672.6163614334.
Adding to 304300231 its reverse (132003403), we get a palindrome (436303634).
The spelling of 304300231 in words is "three hundred four million, three hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •