Base | Representation |
---|---|
bin | 10010000111101… |
… | …111111010001011 |
3 | 210012001212120220 |
4 | 102013233322023 |
5 | 1110312134011 |
6 | 50100121123 |
7 | 10351064661 |
oct | 2207577213 |
9 | 705055526 |
10 | 304021131 |
11 | 146680637 |
12 | 859961a3 |
13 | 4aca817b |
14 | 2c53cc31 |
15 | 1ba55506 |
hex | 121efe8b |
304021131 has 4 divisors (see below), whose sum is σ = 405361512. Its totient is φ = 202680752.
The previous prime is 304021121. The next prime is 304021139. The reversal of 304021131 is 131120403.
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 304021131 - 25 = 304021099 is a prime.
It is a super-2 number, since 2×3040211312 = 184857696189038322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 304021131.
It is not an unprimeable number, because it can be changed into a prime (304021139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50670186 + ... + 50670191.
It is an arithmetic number, because the mean of its divisors is an integer number (101340378).
Almost surely, 2304021131 is an apocalyptic number.
304021131 is a deficient number, since it is larger than the sum of its proper divisors (101340381).
304021131 is a wasteful number, since it uses less digits than its factorization.
304021131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101340380.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 304021131 is about 17436.2017366168. The cubic root of 304021131 is about 672.4106603634.
Adding to 304021131 its reverse (131120403), we get a palindrome (435141534).
The spelling of 304021131 in words is "three hundred four million, twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •