Base | Representation |
---|---|
bin | 101111110011011… |
… | …0010100011011101 |
3 | 11010210012211220211 |
4 | 1133212302203131 |
5 | 11241111112221 |
6 | 423055212421 |
7 | 54514544452 |
oct | 13746624335 |
9 | 4123184824 |
10 | 1604004061 |
11 | 753466aa0 |
12 | 389217111 |
13 | 1c740843a |
14 | 113057829 |
15 | 95c406e1 |
hex | 5f9b28dd |
1604004061 has 8 divisors (see below), whose sum is σ = 1825902144. Its totient is φ = 1394785920.
The previous prime is 1604004049. The next prime is 1604004121.
1604004061 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1604004061 - 211 = 1604002013 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1604004001) 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 7 ways as a sum of consecutive naturals, for example, 3169716 + ... + 3170221.
It is an arithmetic number, because the mean of its divisors is an integer number (228237768).
Almost surely, 21604004061 is an apocalyptic number.
1604004061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1604004061 is a deficient number, since it is larger than the sum of its proper divisors (221898083).
1604004061 is a wasteful number, since it uses less digits than its factorization.
1604004061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6339971.
The product of its (nonzero) digits is 576, while the sum is 22.
The square root of 1604004061 is about 40050.0194881351. The cubic root of 1604004061 is about 1170.5819446533.
It can be divided in two parts, 160400 and 4061, that added together give a palindrome (164461).
The spelling of 1604004061 in words is "one billion, six hundred four million, four thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •