Base | Representation |
---|---|
bin | 111011101110011… |
… | …1000100110111001 |
3 | 12011122222211022201 |
4 | 1313130320212321 |
5 | 13101014414401 |
6 | 530505550201 |
7 | 100443143164 |
oct | 16734704671 |
9 | 5148884281 |
10 | 2004060601 |
11 | 939270434 |
12 | 47b1a5361 |
13 | 25c26969a |
14 | 150234adb |
15 | bae15b01 |
hex | 777389b9 |
2004060601 has 4 divisors (see below), whose sum is σ = 2004546852. Its totient is φ = 2003574352.
The previous prime is 2004060581. The next prime is 2004060719. The reversal of 2004060601 is 1060604002.
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 968765625 + 1035294976 = 31125^2 + 32176^2 .
It is a cyclic number.
It is not a de Polignac number, because 2004060601 - 29 = 2004060089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2004060001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 236890 + ... + 245203.
It is an arithmetic number, because the mean of its divisors is an integer number (501136713).
Almost surely, 22004060601 is an apocalyptic number.
It is an amenable number.
2004060601 is a deficient number, since it is larger than the sum of its proper divisors (486251).
2004060601 is an equidigital number, since it uses as much as digits as its factorization.
2004060601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 486250.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 2004060601 is about 44766.7354293341. The cubic root of 2004060601 is about 1260.7731462634.
Adding to 2004060601 its reverse (1060604002), we get a palindrome (3064664603).
The spelling of 2004060601 in words is "two billion, four million, sixty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •