Base | Representation |
---|---|
bin | 110100011001011100… |
… | …1011000101110001011 |
3 | 101202102220222101202011 |
4 | 1220302321120232023 |
5 | 3320421400211323 |
6 | 123405315320351 |
7 | 11062266114625 |
oct | 1506271305613 |
9 | 352386871664 |
10 | 112523053963 |
11 | 437a236a981 |
12 | 199838b00b7 |
13 | a7c313b848 |
14 | 5636315c15 |
15 | 2dd887920d |
hex | 1a32e58b8b |
112523053963 has 2 divisors, whose sum is σ = 112523053964. Its totient is φ = 112523053962.
The previous prime is 112523053919. The next prime is 112523053997. The reversal of 112523053963 is 369350325211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112523053963 - 225 = 112489499531 is a prime.
It is a super-2 number, since 2×1125230539632 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (112524053963) 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, 56261526981 + 56261526982.
It is an arithmetic number, because the mean of its divisors is an integer number (56261526982).
Almost surely, 2112523053963 is an apocalyptic number.
112523053963 is a deficient number, since it is larger than the sum of its proper divisors (1).
112523053963 is an equidigital number, since it uses as much as digits as its factorization.
112523053963 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 145800, while the sum is 40.
The spelling of 112523053963 in words is "one hundred twelve billion, five hundred twenty-three million, fifty-three thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •