Base | Representation |
---|---|
bin | 10010000111110… |
… | …001010000010001 |
3 | 210012002011010222 |
4 | 102013301100101 |
5 | 1110312323031 |
6 | 50100202425 |
7 | 10351120022 |
oct | 2207612021 |
9 | 705064128 |
10 | 304026641 |
11 | 146684796 |
12 | 85999415 |
13 | 4acaa829 |
14 | 2c540c49 |
15 | 1ba56e7b |
hex | 121f1411 |
304026641 has 8 divisors (see below), whose sum is σ = 321133824. Its totient is φ = 287375760.
The previous prime is 304026607. The next prime is 304026659. The reversal of 304026641 is 146620403.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 304026641 - 214 = 304010257 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 304026641.
It is not an unprimeable number, because it can be changed into a prime (304026661) 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, 112706 + ... + 115371.
It is an arithmetic number, because the mean of its divisors is an integer number (40141728).
Almost surely, 2304026641 is an apocalyptic number.
304026641 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
304026641 is a deficient number, since it is larger than the sum of its proper divisors (17107183).
304026641 is a wasteful number, since it uses less digits than its factorization.
304026641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228151.
The product of its (nonzero) digits is 3456, while the sum is 26.
The square root of 304026641 is about 17436.3597404963. The cubic root of 304026641 is about 672.4147225375.
The spelling of 304026641 in words is "three hundred four million, twenty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •