Base | Representation |
---|---|
bin | 10010000000001… |
… | …111011010001001 |
3 | 210001100212211012 |
4 | 102000033122021 |
5 | 1104311144001 |
6 | 45550013305 |
7 | 10325256665 |
oct | 2200173211 |
9 | 701325735 |
10 | 302053001 |
11 | 145556988 |
12 | 851a7235 |
13 | 4a7693b3 |
14 | 2c1898a5 |
15 | 1b7b72bb |
hex | 1200f689 |
302053001 has 4 divisors (see below), whose sum is σ = 304053504. Its totient is φ = 300052500.
The previous prime is 302052953. The next prime is 302053021. The reversal of 302053001 is 100350203.
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, and also an emirpimes, since its reverse is a distinct semiprime: 100350203 = 2803 ⋅35801.
It is a cyclic number.
It is not a de Polignac number, because 302053001 - 210 = 302051977 is a prime.
It is a Duffinian number.
302053001 is a modest number, since divided by 53001 gives 302 as remainder.
It is not an unprimeable number, because it can be changed into a prime (302053021) 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, 1000025 + ... + 1000326.
It is an arithmetic number, because the mean of its divisors is an integer number (76013376).
Almost surely, 2302053001 is an apocalyptic number.
It is an amenable number.
302053001 is a deficient number, since it is larger than the sum of its proper divisors (2000503).
302053001 is a wasteful number, since it uses less digits than its factorization.
302053001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2000502.
The product of its (nonzero) digits is 90, while the sum is 14.
The square root of 302053001 is about 17379.6720624988. The cubic root of 302053001 is about 670.9565315735.
The spelling of 302053001 in words is "three hundred two million, fifty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •