Base | Representation |
---|---|
bin | 110100010100010101… |
… | …1000101010110001101 |
3 | 101201222222020012102202 |
4 | 1220220223011112031 |
5 | 3320043443014204 |
6 | 123340311131245 |
7 | 11055114161063 |
oct | 1505053052615 |
9 | 351888205382 |
10 | 112351532429 |
11 | 43714569244 |
12 | 19936373b25 |
13 | a796745b06 |
14 | 561b628033 |
15 | 2dc8797e1e |
hex | 1a28ac558d |
112351532429 has 2 divisors, whose sum is σ = 112351532430. Its totient is φ = 112351532428.
The previous prime is 112351532401. The next prime is 112351532453. The reversal of 112351532429 is 924235153211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 80598074404 + 31753458025 = 283898^2 + 178195^2 .
It is an emirp because it is prime and its reverse (924235153211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112351532429 - 224 = 112334755213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112351532392 and 112351532401.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112351532459) 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 as a sum of consecutive naturals, namely, 56175766214 + 56175766215.
It is an arithmetic number, because the mean of its divisors is an integer number (56175766215).
Almost surely, 2112351532429 is an apocalyptic number.
It is an amenable number.
112351532429 is a deficient number, since it is larger than the sum of its proper divisors (1).
112351532429 is an equidigital number, since it uses as much as digits as its factorization.
112351532429 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 64800, while the sum is 38.
The spelling of 112351532429 in words is "one hundred twelve billion, three hundred fifty-one million, five hundred thirty-two thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •