Base | Representation |
---|---|
bin | 11001100001100001111001… |
… | …100110100101001110110111 |
3 | 112201110111120020120000011111 |
4 | 121201201321212211032313 |
5 | 104203142331140432432 |
6 | 1034425213025415451 |
7 | 32434115054253535 |
oct | 3141417146451667 |
9 | 481414506500144 |
10 | 112255305405367 |
11 | 3284a231458863 |
12 | 1070b9b679a587 |
13 | 4a83825ac4517 |
14 | 1da1285a83155 |
15 | cea04118b347 |
hex | 6618799a53b7 |
112255305405367 has 2 divisors, whose sum is σ = 112255305405368. Its totient is φ = 112255305405366.
The previous prime is 112255305405343. The next prime is 112255305405371. The reversal of 112255305405367 is 763504503552211.
It is a strong prime.
It is an emirp because it is prime and its reverse (763504503552211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112255305405367 - 219 = 112255304881079 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112255305405367.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112255305405967) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56127652702683 + 56127652702684.
It is an arithmetic number, because the mean of its divisors is an integer number (56127652702684).
Almost surely, 2112255305405367 is an apocalyptic number.
112255305405367 is a deficient number, since it is larger than the sum of its proper divisors (1).
112255305405367 is an equidigital number, since it uses as much as digits as its factorization.
112255305405367 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3780000, while the sum is 49.
Adding to 112255305405367 its reverse (763504503552211), we get a palindrome (875759808957578).
The spelling of 112255305405367 in words is "one hundred twelve trillion, two hundred fifty-five billion, three hundred five million, four hundred five thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •