Base | Representation |
---|---|
bin | 110111000110000110110001… |
… | …000110100000111000111011 |
3 | 1011202221210222202011111002122 |
4 | 313012012301012200320323 |
5 | 223230020231122310433 |
6 | 2215204354432151455 |
7 | 102016321514411153 |
oct | 6706066106407073 |
9 | 1152853882144078 |
10 | 242312141213243 |
11 | 70232002717732 |
12 | 2321587199858b |
13 | a528c243c474a |
14 | 43b9d8238b763 |
15 | 1d031652ae198 |
hex | dc61b11a0e3b |
242312141213243 has 2 divisors, whose sum is σ = 242312141213244. Its totient is φ = 242312141213242.
The previous prime is 242312141213227. The next prime is 242312141213257. The reversal of 242312141213243 is 342312141213242.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 242312141213243 - 24 = 242312141213227 is a prime.
It is not a weakly prime, because it can be changed into another prime (242312141203243) 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, 121156070606621 + 121156070606622.
It is an arithmetic number, because the mean of its divisors is an integer number (121156070606622).
Almost surely, 2242312141213243 is an apocalyptic number.
242312141213243 is a deficient number, since it is larger than the sum of its proper divisors (1).
242312141213243 is an equidigital number, since it uses as much as digits as its factorization.
242312141213243 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 55296, while the sum is 35.
Adding to 242312141213243 its reverse (342312141213242), we get a palindrome (584624282426485).
Subtracting 242312141213243 from its reverse (342312141213242), we obtain a palindrome (99999999999999).
The spelling of 242312141213243 in words is "two hundred forty-two trillion, three hundred twelve billion, one hundred forty-one million, two hundred thirteen thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •