Base | Representation |
---|---|
bin | 1000101010100101111100100… |
… | …1000011110100111010001001 |
3 | 2221222001112021002010022201022 |
4 | 2022221133021003310322021 |
5 | 1114411124203344320121 |
6 | 10000521404242002225 |
7 | 242304151300461245 |
oct | 21251371103647211 |
9 | 2858045232108638 |
10 | 609781355073161 |
11 | 167327902a76317 |
12 | 58483866046375 |
13 | 2023319a91989b |
14 | aa81809d6d425 |
15 | 4a76c2bd8daab |
hex | 22a97c90f4e89 |
609781355073161 has 2 divisors, whose sum is σ = 609781355073162. Its totient is φ = 609781355073160.
The previous prime is 609781355073139. The next prime is 609781355073257. The reversal of 609781355073161 is 161370553187906.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 472320854907136 + 137460500166025 = 21732944^2 + 11724355^2 .
It is a cyclic number.
It is not a de Polignac number, because 609781355073161 - 246 = 539412610895497 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 609781355073094 and 609781355073103.
It is not a weakly prime, because it can be changed into another prime (609781355073361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 304890677536580 + 304890677536581.
It is an arithmetic number, because the mean of its divisors is an integer number (304890677536581).
Almost surely, 2609781355073161 is an apocalyptic number.
It is an amenable number.
609781355073161 is a deficient number, since it is larger than the sum of its proper divisors (1).
609781355073161 is an equidigital number, since it uses as much as digits as its factorization.
609781355073161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28576800, while the sum is 62.
The spelling of 609781355073161 in words is "six hundred nine trillion, seven hundred eighty-one billion, three hundred fifty-five million, seventy-three thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •