Base | Representation |
---|---|
bin | 110100010011000110… |
… | …1000010100001111111 |
3 | 101201220002021022202201 |
4 | 1220212031002201333 |
5 | 3320002341232033 |
6 | 123332231132331 |
7 | 11054102055061 |
oct | 1504615024177 |
9 | 351802238681 |
10 | 112310102143 |
11 | 436a3141038 |
12 | 199245140a7 |
13 | a78ac9b255 |
14 | 5615d21731 |
15 | 2dc4d1247d |
hex | 1a2634287f |
112310102143 has 8 divisors (see below), whose sum is σ = 114579568656. Its totient is φ = 110046206400.
The previous prime is 112310102111. The next prime is 112310102153. The reversal of 112310102143 is 341201013211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112310102143 - 25 = 112310102111 is a prime.
It is a super-2 number, since 2×1123101021432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112310102143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112310102153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1351953 + ... + 1432618.
It is an arithmetic number, because the mean of its divisors is an integer number (14322446082).
Almost surely, 2112310102143 is an apocalyptic number.
112310102143 is a deficient number, since it is larger than the sum of its proper divisors (2269466513).
112310102143 is an equidigital number, since it uses as much as digits as its factorization.
112310102143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2785385.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 112310102143 its reverse (341201013211), we get a palindrome (453511115354).
The spelling of 112310102143 in words is "one hundred twelve billion, three hundred ten million, one hundred two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •