Base | Representation |
---|---|
bin | 100111011010101101… |
… | …010010100001110101 |
3 | 11001020122002112102121 |
4 | 213122231102201311 |
5 | 1143134421324000 |
6 | 31235434235541 |
7 | 3025554105304 |
oct | 473255224165 |
9 | 131218075377 |
10 | 42324011125 |
11 | 16a49889aa0 |
12 | 8252285bb1 |
13 | 3cb66b3786 |
14 | 20970ca43b |
15 | 117aa4cb1a |
hex | 9dab52875 |
42324011125 has 32 divisors (see below), whose sum is σ = 58848311808. Its totient is φ = 30126136000.
The previous prime is 42324011117. The next prime is 42324011129. The reversal of 42324011125 is 52111042324.
It is not a de Polignac number, because 42324011125 - 23 = 42324011117 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a self number, because there is not a number n which added to its sum of digits gives 42324011125.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42324011129) 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 31 ways as a sum of consecutive naturals, for example, 262834 + ... + 392083.
It is an arithmetic number, because the mean of its divisors is an integer number (1839009744).
Almost surely, 242324011125 is an apocalyptic number.
It is an amenable number.
42324011125 is a deficient number, since it is larger than the sum of its proper divisors (16524300683).
42324011125 is a wasteful number, since it uses less digits than its factorization.
42324011125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 654990 (or 654980 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 25.
Adding to 42324011125 its reverse (52111042324), we get a palindrome (94435053449).
The spelling of 42324011125 in words is "forty-two billion, three hundred twenty-four million, eleven thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •