Base | Representation |
---|---|
bin | 110100001110001000… |
… | …1010110101110000011 |
3 | 101201110110201002102211 |
4 | 1220130101112232003 |
5 | 3314132211230001 |
6 | 123303515322551 |
7 | 11050006456423 |
oct | 1503421265603 |
9 | 351413632384 |
10 | 112143461251 |
11 | 43618073298 |
12 | 19898750457 |
13 | a7625c3b83 |
14 | 55dbb44483 |
15 | 2db5397351 |
hex | 1a1c456b83 |
112143461251 has 2 divisors, whose sum is σ = 112143461252. Its totient is φ = 112143461250.
The previous prime is 112143461197. The next prime is 112143461267. The reversal of 112143461251 is 152164341211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112143461251 - 211 = 112143459203 is a prime.
It is not a weakly prime, because it can be changed into another prime (112143462251) 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, 56071730625 + 56071730626.
It is an arithmetic number, because the mean of its divisors is an integer number (56071730626).
Almost surely, 2112143461251 is an apocalyptic number.
112143461251 is a deficient number, since it is larger than the sum of its proper divisors (1).
112143461251 is an equidigital number, since it uses as much as digits as its factorization.
112143461251 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5760, while the sum is 31.
The spelling of 112143461251 in words is "one hundred twelve billion, one hundred forty-three million, four hundred sixty-one thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •