Base | Representation |
---|---|
bin | 11001100000110010010000… |
… | …000110101000111001000111 |
3 | 112201021121111200000202220022 |
4 | 121200302100012220321013 |
5 | 104201323041141101132 |
6 | 1034345512152125355 |
7 | 32430324161452142 |
oct | 3140622006507107 |
9 | 481247450022808 |
10 | 112204143300167 |
11 | 3282a567811996 |
12 | 10701ab869685b |
13 | 4a7ba6136a8a9 |
14 | 1d9c9d0c89059 |
15 | ce8a49793e12 |
hex | 660c901a8e47 |
112204143300167 has 2 divisors, whose sum is σ = 112204143300168. Its totient is φ = 112204143300166.
The previous prime is 112204143300101. The next prime is 112204143300259. The reversal of 112204143300167 is 761003341402211.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 112204143300167 - 238 = 111929265393223 is a prime.
It is a super-2 number, since 2×1122041433001672 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112204143600167) 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 as a sum of consecutive naturals, namely, 56102071650083 + 56102071650084.
It is an arithmetic number, because the mean of its divisors is an integer number (56102071650084).
Almost surely, 2112204143300167 is an apocalyptic number.
112204143300167 is a deficient number, since it is larger than the sum of its proper divisors (1).
112204143300167 is an equidigital number, since it uses as much as digits as its factorization.
112204143300167 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24192, while the sum is 35.
Adding to 112204143300167 its reverse (761003341402211), we get a palindrome (873207484702378).
The spelling of 112204143300167 in words is "one hundred twelve trillion, two hundred four billion, one hundred forty-three million, three hundred thousand, one hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •