Base | Representation |
---|---|
bin | 10010000000110… |
… | …001110110100001 |
3 | 210001122001100101 |
4 | 102000301312201 |
5 | 1104330202311 |
6 | 45553022401 |
7 | 10326415210 |
oct | 2200616641 |
9 | 701561311 |
10 | 302194081 |
11 | 145642982 |
12 | 85254a01 |
13 | 4a7b8687 |
14 | 2c1c5077 |
15 | 1b7e3ec1 |
hex | 12031da1 |
302194081 has 8 divisors (see below), whose sum is σ = 346114304. Its totient is φ = 258461280.
The previous prime is 302194051. The next prime is 302194111. The reversal of 302194081 is 180491203.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (302194051) and next prime (302194111).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 302194081 - 29 = 302193569 is a prime.
It is a super-2 number, since 2×3021940812 = 182642525182869122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (302194021) 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, 43380 + ... + 49861.
It is an arithmetic number, because the mean of its divisors is an integer number (43264288).
Almost surely, 2302194081 is an apocalyptic number.
It is an amenable number.
302194081 is a deficient number, since it is larger than the sum of its proper divisors (43920223).
302194081 is an equidigital number, since it uses as much as digits as its factorization.
302194081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93711.
The product of its (nonzero) digits is 1728, while the sum is 28.
The square root of 302194081 is about 17383.7303534080. The cubic root of 302194081 is about 671.0609766141.
The spelling of 302194081 in words is "three hundred two million, one hundred ninety-four thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •