Base | Representation |
---|---|
bin | 10010001000001… |
… | …101101100010001 |
3 | 210012022001221001 |
4 | 102020031230101 |
5 | 1110330034441 |
6 | 50102502001 |
7 | 10352113432 |
oct | 2210155421 |
9 | 705261831 |
10 | 304143121 |
11 | 146754257 |
12 | 85a34901 |
13 | 4b01b859 |
14 | 2c571489 |
15 | 1ba7b731 |
hex | 1220db11 |
304143121 has 8 divisors (see below), whose sum is σ = 306671400. Its totient is φ = 301621632.
The previous prime is 304143109. The next prime is 304143131. The reversal of 304143121 is 121341403.
It can be written as a sum of positive squares in 4 ways, for example, as 49900096 + 254243025 = 7064^2 + 15945^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-304143121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (304143131) 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 7 ways as a sum of consecutive naturals, for example, 125901 + ... + 128293.
It is an arithmetic number, because the mean of its divisors is an integer number (38333925).
Almost surely, 2304143121 is an apocalyptic number.
It is an amenable number.
304143121 is a deficient number, since it is larger than the sum of its proper divisors (2528279).
304143121 is a wasteful number, since it uses less digits than its factorization.
304143121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3395.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 304143121 is about 17439.6995673664. The cubic root of 304143121 is about 672.5005843843.
Adding to 304143121 its reverse (121341403), we get a palindrome (425484524).
The spelling of 304143121 in words is "three hundred four million, one hundred forty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •