Base | Representation |
---|---|
bin | 110100001010110100… |
… | …0101100010010010111 |
3 | 101201011201020022011221 |
4 | 1220111220230102113 |
5 | 3313420211412031 |
6 | 123244501311211 |
7 | 11044155315115 |
oct | 1502550542227 |
9 | 351151208157 |
10 | 112032138391 |
11 | 43570248828 |
12 | 19867405507 |
13 | a745517664 |
14 | 55cb046ab5 |
15 | 2daa707a11 |
hex | 1a15a2c497 |
112032138391 has 2 divisors, whose sum is σ = 112032138392. Its totient is φ = 112032138390.
The previous prime is 112032138331. The next prime is 112032138409. The reversal of 112032138391 is 193831230211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112032138391 - 27 = 112032138263 is a prime.
It is a super-3 number, since 3×1120321383913 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112032138331) 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, 56016069195 + 56016069196.
It is an arithmetic number, because the mean of its divisors is an integer number (56016069196).
Almost surely, 2112032138391 is an apocalyptic number.
112032138391 is a deficient number, since it is larger than the sum of its proper divisors (1).
112032138391 is an equidigital number, since it uses as much as digits as its factorization.
112032138391 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 34.
The spelling of 112032138391 in words is "one hundred twelve billion, thirty-two million, one hundred thirty-eight thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •