Base | Representation |
---|---|
bin | 110100011010000100… |
… | …1110011100011111111 |
3 | 101202111101122110001222 |
4 | 1220310021303203333 |
5 | 3320442244313143 |
6 | 123411351223555 |
7 | 11062643236616 |
oct | 1506411634377 |
9 | 352441573058 |
10 | 112544135423 |
11 | 43803259775 |
12 | 1998a977bbb |
13 | a7c7610295 |
14 | 563904287d |
15 | 2dda640768 |
hex | 1a342738ff |
112544135423 has 4 divisors (see below), whose sum is σ = 112545153240. Its totient is φ = 112543117608.
The previous prime is 112544135419. The next prime is 112544135441. The reversal of 112544135423 is 324531445211.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 324531445211 = 186437 ⋅1740703.
It is a cyclic number.
It is not a de Polignac number, because 112544135423 - 22 = 112544135419 is a prime.
It is a super-2 number, since 2×1125441354232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112544135413) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 319565 + ... + 572022.
It is an arithmetic number, because the mean of its divisors is an integer number (28136288310).
Almost surely, 2112544135423 is an apocalyptic number.
112544135423 is a deficient number, since it is larger than the sum of its proper divisors (1017817).
112544135423 is an equidigital number, since it uses as much as digits as its factorization.
112544135423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1017816.
The product of its digits is 57600, while the sum is 35.
The spelling of 112544135423 in words is "one hundred twelve billion, five hundred forty-four million, one hundred thirty-five thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •