Base | Representation |
---|---|
bin | 110111000110101110010111… |
… | …011110110111011111000001 |
3 | 1011210002212202000202122001211 |
4 | 313012232113132313133001 |
5 | 223231214321213000333 |
6 | 2215240105544130121 |
7 | 102022355300231422 |
oct | 6706562736673701 |
9 | 1153085660678054 |
10 | 242354661062593 |
11 | 70249041aa68a2 |
12 | 23221b59766941 |
13 | a52cc3c536111 |
14 | 43bc057495649 |
15 | 1d043030e2ecd |
hex | dc6b977b77c1 |
242354661062593 has 2 divisors, whose sum is σ = 242354661062594. Its totient is φ = 242354661062592.
The previous prime is 242354661062539. The next prime is 242354661062621. The reversal of 242354661062593 is 395260166453242.
It is a happy number.
Together with previous prime (242354661062539) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 240940959086529 + 1413701976064 = 15522273^2 + 1188992^2 .
It is a cyclic number.
It is not a de Polignac number, because 242354661062593 - 217 = 242354660931521 is a prime.
It is not a weakly prime, because it can be changed into another prime (242354665062593) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121177330531296 + 121177330531297.
It is an arithmetic number, because the mean of its divisors is an integer number (121177330531297).
Almost surely, 2242354661062593 is an apocalyptic number.
It is an amenable number.
242354661062593 is a deficient number, since it is larger than the sum of its proper divisors (1).
242354661062593 is an equidigital number, since it uses as much as digits as its factorization.
242354661062593 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 55987200, while the sum is 58.
The spelling of 242354661062593 in words is "two hundred forty-two trillion, three hundred fifty-four billion, six hundred sixty-one million, sixty-two thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •