Base | Representation |
---|---|
bin | 10011001001101000011110… |
… | …11111101011101111010111 |
3 | 12112002220111120010001012111 |
4 | 21210310033133223233113 |
5 | 21004432211030114033 |
6 | 225322102005531451 |
7 | 11604343612251064 |
oct | 1144641737535727 |
9 | 175086446101174 |
10 | 42112414301143 |
11 | 1246685800616a |
12 | 4881802413b87 |
13 | 1a66250580b94 |
14 | a58374a51c6b |
15 | 4d0691c407cd |
hex | 264d0f7ebbd7 |
42112414301143 has 2 divisors, whose sum is σ = 42112414301144. Its totient is φ = 42112414301142.
The previous prime is 42112414301137. The next prime is 42112414301189. The reversal of 42112414301143 is 34110341421124.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 42112414301143 - 237 = 41974975347671 is a prime.
It is a super-2 number, since 2×421124143011432 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42112414391143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21056207150571 + 21056207150572.
It is an arithmetic number, because the mean of its divisors is an integer number (21056207150572).
Almost surely, 242112414301143 is an apocalyptic number.
42112414301143 is a deficient number, since it is larger than the sum of its proper divisors (1).
42112414301143 is an equidigital number, since it uses as much as digits as its factorization.
42112414301143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 31.
Adding to 42112414301143 its reverse (34110341421124), we get a palindrome (76222755722267).
The spelling of 42112414301143 in words is "forty-two trillion, one hundred twelve billion, four hundred fourteen million, three hundred one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •