Base | Representation |
---|---|
bin | 110111001101001110110010… |
… | …101001111111001111111111 |
3 | 1011211200121212110110000210222 |
4 | 313031032302221333033333 |
5 | 223311031033122432344 |
6 | 2220221334253251555 |
7 | 102066564534612116 |
oct | 6715166251771777 |
9 | 1154617773400728 |
10 | 242801793561599 |
11 | 704007316aa308 |
12 | 23294745493bbb |
13 | a563159811a0c |
14 | 43d59531d2c7d |
15 | 1d10c727615ee |
hex | dcd3b2a7f3ff |
242801793561599 has 2 divisors, whose sum is σ = 242801793561600. Its totient is φ = 242801793561598.
The previous prime is 242801793561529. The next prime is 242801793561601. The reversal of 242801793561599 is 995165397108242.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 242801793561599 - 28 = 242801793561343 is a prime.
It is a Sophie Germain prime.
Together with 242801793561601, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (242801793561529) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121400896780799 + 121400896780800.
It is an arithmetic number, because the mean of its divisors is an integer number (121400896780800).
It is a 2-persistent number, because it is pandigital, and so is 2⋅242801793561599 = 485603587123198, but 3⋅242801793561599 = 728405380684797 is not.
Almost surely, 2242801793561599 is an apocalyptic number.
242801793561599 is a deficient number, since it is larger than the sum of its proper divisors (1).
242801793561599 is an equidigital number, since it uses as much as digits as its factorization.
242801793561599 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 293932800, while the sum is 71.
The spelling of 242801793561599 in words is "two hundred forty-two trillion, eight hundred one billion, seven hundred ninety-three million, five hundred sixty-one thousand, five hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •