Base | Representation |
---|---|
bin | 110100001101001110… |
… | …1100010010110111111 |
3 | 101201101100120120221022 |
4 | 1220122131202112333 |
5 | 3314101423201343 |
6 | 123300512454355 |
7 | 11046160425335 |
oct | 1503235422677 |
9 | 351340516838 |
10 | 112113100223 |
11 | 43601a16633 |
12 | 1988a54a3bb |
13 | a759223777 |
14 | 55d7abdb55 |
15 | 2db289b568 |
hex | 1a1a7625bf |
112113100223 has 4 divisors (see below), whose sum is σ = 112341436968. Its totient is φ = 111884763480.
The previous prime is 112113100207. The next prime is 112113100241. The reversal of 112113100223 is 322001311211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 322001311211 = 317621 ⋅1013791.
It is a cyclic number.
It is not a de Polignac number, because 112113100223 - 24 = 112113100207 is a prime.
It is a super-2 number, since 2×1121131002232 (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 (112113100273) 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, 114167636 + ... + 114168617.
It is an arithmetic number, because the mean of its divisors is an integer number (28085359242).
Almost surely, 2112113100223 is an apocalyptic number.
112113100223 is a deficient number, since it is larger than the sum of its proper divisors (228336745).
112113100223 is an equidigital number, since it uses as much as digits as its factorization.
112113100223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228336744.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 112113100223 its reverse (322001311211), we get a palindrome (434114411434).
The spelling of 112113100223 in words is "one hundred twelve billion, one hundred thirteen million, one hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •