Base | Representation |
---|---|
bin | 100111011011001100… |
… | …001100100010000111 |
3 | 11001021012100011011012 |
4 | 213123030030202013 |
5 | 1143144010104111 |
6 | 31240324032435 |
7 | 3026013011105 |
oct | 473314144207 |
9 | 131235304135 |
10 | 42332113031 |
11 | 16a5341308a |
12 | 8254b3271b |
13 | 3cb828c3c0 |
14 | 20981d8c75 |
15 | 117b5ed48b |
hex | 9db30c887 |
42332113031 has 48 divisors (see below), whose sum is σ = 49818450528. Its totient is φ = 35724499200.
The previous prime is 42332113027. The next prime is 42332113037. The reversal of 42332113031 is 13031123324.
It is not a de Polignac number, because 42332113031 - 22 = 42332113027 is a prime.
It is a super-2 number, since 2×423321130312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 42332112988 and 42332113006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42332113037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 22746041 + ... + 22747901.
It is an arithmetic number, because the mean of its divisors is an integer number (1037884386).
Almost surely, 242332113031 is an apocalyptic number.
42332113031 is a deficient number, since it is larger than the sum of its proper divisors (7486337497).
42332113031 is a wasteful number, since it uses less digits than its factorization.
42332113031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2080 (or 2061 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 42332113031 its reverse (13031123324), we get a palindrome (55363236355).
The spelling of 42332113031 in words is "forty-two billion, three hundred thirty-two million, one hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •