Base | Representation |
---|---|
bin | 10010001001000… |
… | …000101110001101 |
3 | 210012200200122112 |
4 | 102021000232031 |
5 | 1110403232031 |
6 | 50111153405 |
7 | 10353644012 |
oct | 2211005615 |
9 | 705620575 |
10 | 304352141 |
11 | 1468872a5 |
12 | 85b15865 |
13 | 4b092a32 |
14 | 2c5c7709 |
15 | 1babd62b |
hex | 12240b8d |
304352141 has 4 divisors (see below), whose sum is σ = 314169984. Its totient is φ = 294534300.
The previous prime is 304352117. The next prime is 304352159. The reversal of 304352141 is 141253403.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 304352141 - 218 = 304089997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (304352101) 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, 4908875 + ... + 4908936.
It is an arithmetic number, because the mean of its divisors is an integer number (78542496).
Almost surely, 2304352141 is an apocalyptic number.
304352141 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
304352141 is a deficient number, since it is larger than the sum of its proper divisors (9817843).
304352141 is an equidigital number, since it uses as much as digits as its factorization.
304352141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9817842.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 304352141 is about 17445.6911872244. The cubic root of 304352141 is about 672.6546060424.
The spelling of 304352141 in words is "three hundred four million, three hundred fifty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •