Base | Representation |
---|---|
bin | 110100010011100101… |
… | …0101111000001010001 |
3 | 101201221012200222222002 |
4 | 1220213022233001101 |
5 | 3320021011301103 |
6 | 123334005523345 |
7 | 11054356404521 |
oct | 1504712570121 |
9 | 351835628862 |
10 | 112326275153 |
11 | 43701288064 |
12 | 19929a13555 |
13 | a791441791 |
14 | 5618131681 |
15 | 2dc6459488 |
hex | 1a272af051 |
112326275153 has 2 divisors, whose sum is σ = 112326275154. Its totient is φ = 112326275152.
The previous prime is 112326275119. The next prime is 112326275219. The reversal of 112326275153 is 351572623211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100104530449 + 12221744704 = 316393^2 + 110552^2 .
It is an emirp because it is prime and its reverse (351572623211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112326275153 - 226 = 112259166289 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (112326275053) 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, 56163137576 + 56163137577.
It is an arithmetic number, because the mean of its divisors is an integer number (56163137577).
Almost surely, 2112326275153 is an apocalyptic number.
It is an amenable number.
112326275153 is a deficient number, since it is larger than the sum of its proper divisors (1).
112326275153 is an equidigital number, since it uses as much as digits as its factorization.
112326275153 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 75600, while the sum is 38.
Adding to 112326275153 its reverse (351572623211), we get a palindrome (463898898364).
The spelling of 112326275153 in words is "one hundred twelve billion, three hundred twenty-six million, two hundred seventy-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •