Base | Representation |
---|---|
bin | 100111001110000110… |
… | …001011100100101111 |
3 | 11000200212222020000200 |
4 | 213032012023210233 |
5 | 1142221240314211 |
6 | 31202435324543 |
7 | 3020404524636 |
oct | 471606134457 |
9 | 130625866020 |
10 | 42112432431 |
11 | 16950408873 |
12 | 81b3450753 |
13 | 3c81904194 |
14 | 2076d7251d |
15 | 11671a7b56 |
hex | 9ce18b92f |
42112432431 has 24 divisors (see below), whose sum is σ = 61263342816. Its totient is φ = 27874713600.
The previous prime is 42112432423. The next prime is 42112432433. The reversal of 42112432431 is 13423421124.
It is not a de Polignac number, because 42112432431 - 23 = 42112432423 is a prime.
It is a super-2 number, since 2×421124324312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 42112432395 and 42112432404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42112432433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3082191 + ... + 3095823.
It is an arithmetic number, because the mean of its divisors is an integer number (2552639284).
Almost surely, 242112432431 is an apocalyptic number.
42112432431 is a deficient number, since it is larger than the sum of its proper divisors (19150910385).
42112432431 is a wasteful number, since it uses less digits than its factorization.
42112432431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16063 (or 16060 counting only the distinct ones).
The product of its digits is 4608, while the sum is 27.
Adding to 42112432431 its reverse (13423421124), we get a palindrome (55535853555).
The spelling of 42112432431 in words is "forty-two billion, one hundred twelve million, four hundred thirty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •