Base | Representation |
---|---|
bin | 10010001000000… |
… | …110010011110001 |
3 | 210012020112110001 |
4 | 102020012103301 |
5 | 1110323103011 |
6 | 50102110001 |
7 | 10351626322 |
oct | 2210062361 |
9 | 705215401 |
10 | 304112881 |
11 | 146733566 |
12 | 85a1b301 |
13 | 4b00ab67 |
14 | 2c564449 |
15 | 1ba727c1 |
hex | 122064f1 |
304112881 has 4 divisors (see below), whose sum is σ = 322001892. Its totient is φ = 286223872.
The previous prime is 304112873. The next prime is 304112891. The reversal of 304112881 is 188211403.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 83887281 + 220225600 = 9159^2 + 14840^2 .
It is a cyclic number.
It is not a de Polignac number, because 304112881 - 23 = 304112873 is a prime.
It is a super-2 number, since 2×3041128812 = 184969288780240322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (304112801) 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, 8944480 + ... + 8944513.
It is an arithmetic number, because the mean of its divisors is an integer number (80500473).
Almost surely, 2304112881 is an apocalyptic number.
It is an amenable number.
304112881 is a deficient number, since it is larger than the sum of its proper divisors (17889011).
304112881 is a wasteful number, since it uses less digits than its factorization.
304112881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17889010.
The product of its (nonzero) digits is 1536, while the sum is 28.
The square root of 304112881 is about 17438.8325584025. The cubic root of 304112881 is about 672.4782954351.
The spelling of 304112881 in words is "three hundred four million, one hundred twelve thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •