Base | Representation |
---|---|
bin | 10001101111011110001… |
… | …00110101001101110101 |
3 | 2011021111011121012210122 |
4 | 20313233010311031311 |
5 | 34441430430104114 |
6 | 1144014053501325 |
7 | 62020330326512 |
oct | 10675704651565 |
9 | 2137434535718 |
10 | 609601409909 |
11 | 215592115a08 |
12 | 9a18a341845 |
13 | 4563cbab04b |
14 | 2170d4cc309 |
15 | 10cccc44e8e |
hex | 8def135375 |
609601409909 has 2 divisors, whose sum is σ = 609601409910. Its totient is φ = 609601409908.
The previous prime is 609601409899. The next prime is 609601409953. The reversal of 609601409909 is 909904106906.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 515538360100 + 94063049809 = 718010^2 + 306697^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-609601409909 is a prime.
It is a super-3 number, since 3×6096014099093 (a number of 36 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (609601409999) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 304800704954 + 304800704955.
It is an arithmetic number, because the mean of its divisors is an integer number (304800704955).
Almost surely, 2609601409909 is an apocalyptic number.
It is an amenable number.
609601409909 is a deficient number, since it is larger than the sum of its proper divisors (1).
609601409909 is an equidigital number, since it uses as much as digits as its factorization.
609601409909 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 944784, while the sum is 53.
The spelling of 609601409909 in words is "six hundred nine billion, six hundred one million, four hundred nine thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •