Base | Representation |
---|---|
bin | 100011111000010… |
… | …100000001100001 |
3 | 1112221200222020201 |
4 | 203320110001201 |
5 | 2213100332031 |
6 | 135422105201 |
7 | 20626420645 |
oct | 4370240141 |
9 | 1487628221 |
10 | 601964641 |
11 | 28987aa43 |
12 | 14971b201 |
13 | 97935bc5 |
14 | 59d38c25 |
15 | 37ca9d61 |
hex | 23e14061 |
601964641 has 2 divisors, whose sum is σ = 601964642. Its totient is φ = 601964640.
The previous prime is 601964567. The next prime is 601964677. The reversal of 601964641 is 146469106.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 454585041 + 147379600 = 21321^2 + 12140^2 .
It is a cyclic number.
It is not a de Polignac number, because 601964641 - 211 = 601962593 is a prime.
It is a super-2 number, since 2×6019646412 = 724722858028517762, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 601964641.
It is not a weakly prime, because it can be changed into another prime (601964681) 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 as a sum of consecutive naturals, namely, 300982320 + 300982321.
It is an arithmetic number, because the mean of its divisors is an integer number (300982321).
Almost surely, 2601964641 is an apocalyptic number.
It is an amenable number.
601964641 is a deficient number, since it is larger than the sum of its proper divisors (1).
601964641 is an equidigital number, since it uses as much as digits as its factorization.
601964641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 37.
The square root of 601964641 is about 24534.9677195630. The cubic root of 601964641 is about 844.3522414520.
The spelling of 601964641 in words is "six hundred one million, nine hundred sixty-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •