Base | Representation |
---|---|
bin | 10001100101001110011… |
… | …00101001001110110001 |
3 | 2010202021210201121201020 |
4 | 20302213030221032301 |
5 | 34344144213443441 |
6 | 1141304150530053 |
7 | 61434113535153 |
oct | 10624714511661 |
9 | 2122253647636 |
10 | 604100531121 |
11 | 21321a00129a |
12 | 990b4066929 |
13 | 44c7434a399 |
14 | 2134aac6ad3 |
15 | 10aa9d4ee66 |
hex | 8ca73293b1 |
604100531121 has 8 divisors (see below), whose sum is σ = 807207047040. Its totient is φ = 401863851312.
The previous prime is 604100531081. The next prime is 604100531131. The reversal of 604100531121 is 121135001406.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 604100531121 - 223 = 604092142513 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 604100531091 and 604100531100.
It is not an unprimeable number, because it can be changed into a prime (604100531131) 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, 217457406 + ... + 217460183.
It is an arithmetic number, because the mean of its divisors is an integer number (100900880880).
Almost surely, 2604100531121 is an apocalyptic number.
It is an amenable number.
604100531121 is a deficient number, since it is larger than the sum of its proper divisors (203106515919).
604100531121 is a wasteful number, since it uses less digits than its factorization.
604100531121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 434918055.
The product of its (nonzero) digits is 720, while the sum is 24.
Adding to 604100531121 its reverse (121135001406), we get a palindrome (725235532527).
The spelling of 604100531121 in words is "six hundred four billion, one hundred million, five hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •