Base | Representation |
---|---|
bin | 110100001110001000… |
… | …1010000000111011011 |
3 | 101201110110122201100001 |
4 | 1220130101100013123 |
5 | 3314132204343303 |
6 | 123303514553431 |
7 | 11050006314523 |
oct | 1503421200733 |
9 | 351413581301 |
10 | 112143434203 |
11 | 43618054a39 |
12 | 19898738877 |
13 | a7625b4778 |
14 | 55dbb38683 |
15 | 2db538e31d |
hex | 1a1c4501db |
112143434203 has 4 divisors (see below), whose sum is σ = 112371832728. Its totient is φ = 111915035680.
The previous prime is 112143434177. The next prime is 112143434239. The reversal of 112143434203 is 302434341211.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 302434341211 = 282599 ⋅1070189.
It is a cyclic number.
It is not a de Polignac number, because 112143434203 - 217 = 112143303131 is a prime.
It is a super-2 number, since 2×1121434342032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112143434303) 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, 114198526 + ... + 114199507.
It is an arithmetic number, because the mean of its divisors is an integer number (28092958182).
Almost surely, 2112143434203 is an apocalyptic number.
112143434203 is a deficient number, since it is larger than the sum of its proper divisors (228398525).
112143434203 is an equidigital number, since it uses as much as digits as its factorization.
112143434203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 228398524.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 112143434203 its reverse (302434341211), we get a palindrome (414577775414).
The spelling of 112143434203 in words is "one hundred twelve billion, one hundred forty-three million, four hundred thirty-four thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •