Base | Representation |
---|---|
bin | 1001010100010000010… |
… | …10111000010000000101 |
3 | 1010121021011110020201120 |
4 | 10222020022320100011 |
5 | 20221042201230000 |
6 | 403020225544153 |
7 | 32061451144101 |
oct | 4521012702005 |
9 | 1117234406646 |
10 | 320112133125 |
11 | 113838a54624 |
12 | 52058aa5059 |
13 | 242568077b5 |
14 | 116ca296901 |
15 | 84d81c96a0 |
hex | 4a882b8405 |
320112133125 has 80 divisors (see below), whose sum is σ = 543336076800. Its totient is φ = 167539960000.
The previous prime is 320112133111. The next prime is 320112133127. The reversal of 320112133125 is 521331211023.
It is a happy number.
It is not a de Polignac number, because 320112133125 - 216 = 320112067589 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 320112133095 and 320112133104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320112133127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 72899680 + ... + 72904070.
It is an arithmetic number, because the mean of its divisors is an integer number (6791700960).
Almost surely, 2320112133125 is an apocalyptic number.
It is an amenable number.
320112133125 is a deficient number, since it is larger than the sum of its proper divisors (223223943675).
320112133125 is an equidigital number, since it uses as much as digits as its factorization.
320112133125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5132 (or 5117 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 24.
Adding to 320112133125 its reverse (521331211023), we get a palindrome (841443344148).
The spelling of 320112133125 in words is "three hundred twenty billion, one hundred twelve million, one hundred thirty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •