Base | Representation |
---|---|
bin | 10001111100011… |
… | …000100101010001 |
3 | 202222110111222202 |
4 | 101330120211101 |
5 | 1104031321001 |
6 | 45512212545 |
7 | 10313546321 |
oct | 2174304521 |
9 | 688414882 |
10 | 301042001 |
11 | 144a26347 |
12 | 8499a155 |
13 | 4a4a4180 |
14 | 2bda5281 |
15 | 1b66796b |
hex | 11f18951 |
301042001 has 8 divisors (see below), whose sum is σ = 343269864. Its totient is φ = 261538560.
The previous prime is 301041991. The next prime is 301042081. The reversal of 301042001 is 100240103.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 6027025 + 295014976 = 2455^2 + 17176^2 .
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 301042001 - 214 = 301025617 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (301042081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 680870 + ... + 681311.
It is an arithmetic number, because the mean of its divisors is an integer number (42908733).
Almost surely, 2301042001 is an apocalyptic number.
It is an amenable number.
301042001 is a deficient number, since it is larger than the sum of its proper divisors (42227863).
301042001 is a wasteful number, since it uses less digits than its factorization.
301042001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1362211.
The product of its (nonzero) digits is 24, while the sum is 11.
The square root of 301042001 is about 17350.5619793712. The cubic root of 301042001 is about 670.2071098041.
Adding to 301042001 its reverse (100240103), we get a palindrome (401282104).
The spelling of 301042001 in words is "three hundred one million, forty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •