Base | Representation |
---|---|
bin | 10011010000010000101010… |
… | …01110000011111010010111 |
3 | 12112220200022101222122112012 |
4 | 21220020111032003322113 |
5 | 21022200103231032133 |
6 | 230014443215214435 |
7 | 11626655141406461 |
oct | 1150102516037227 |
9 | 175820271878465 |
10 | 42340143611543 |
11 | 12544399299718 |
12 | 48b997851741b |
13 | 1a818736b311b |
14 | a653b977d131 |
15 | 4d656e7abb48 |
hex | 268215383e97 |
42340143611543 has 2 divisors, whose sum is σ = 42340143611544. Its totient is φ = 42340143611542.
The previous prime is 42340143611461. The next prime is 42340143611573. The reversal of 42340143611543 is 34511634104324.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42340143611543 is a prime.
It is a super-2 number, since 2×423401436115432 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 42340143611543.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42340143611573) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21170071805771 + 21170071805772.
It is an arithmetic number, because the mean of its divisors is an integer number (21170071805772).
Almost surely, 242340143611543 is an apocalyptic number.
42340143611543 is a deficient number, since it is larger than the sum of its proper divisors (1).
42340143611543 is an equidigital number, since it uses as much as digits as its factorization.
42340143611543 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 414720, while the sum is 41.
Adding to 42340143611543 its reverse (34511634104324), we get a palindrome (76851777715867).
The spelling of 42340143611543 in words is "forty-two trillion, three hundred forty billion, one hundred forty-three million, six hundred eleven thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •