Base | Representation |
---|---|
bin | 110100001001110111… |
… | …0110110110111011101 |
3 | 101201002111010200011101 |
4 | 1220103232312313131 |
5 | 3313334022401112 |
6 | 123241400553101 |
7 | 11043316664536 |
oct | 1502356666735 |
9 | 351074120141 |
10 | 112000200157 |
11 | 4355421409a |
12 | 19858782791 |
13 | a73ba143b1 |
14 | 55c6ad168d |
15 | 2da79e9757 |
hex | 1a13bb6ddd |
112000200157 has 2 divisors, whose sum is σ = 112000200158. Its totient is φ = 112000200156.
The previous prime is 112000200061. The next prime is 112000200167. The reversal of 112000200157 is 751002000211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83088639001 + 28911561156 = 288251^2 + 170034^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112000200157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112000200167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56000100078 + 56000100079.
It is an arithmetic number, because the mean of its divisors is an integer number (56000100079).
Almost surely, 2112000200157 is an apocalyptic number.
It is an amenable number.
112000200157 is a deficient number, since it is larger than the sum of its proper divisors (1).
112000200157 is an equidigital number, since it uses as much as digits as its factorization.
112000200157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 140, while the sum is 19.
Adding to 112000200157 its reverse (751002000211), we get a palindrome (863002200368).
The spelling of 112000200157 in words is "one hundred twelve billion, two hundred thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •