Base | Representation |
---|---|
bin | 110100010011001100… |
… | …0111100000001100111 |
3 | 101201220022010210100012 |
4 | 1220212120330001213 |
5 | 3320004141034343 |
6 | 123332422040435 |
7 | 11054140425440 |
oct | 1504630740147 |
9 | 351808123305 |
10 | 112313221223 |
11 | 436a4981495 |
12 | 1992557911b |
13 | a78b820b68 |
14 | 56164d42c7 |
15 | 2dc522b718 |
hex | 1a2663c067 |
112313221223 has 8 divisors (see below), whose sum is σ = 128364312960. Its totient is φ = 96263715960.
The previous prime is 112313221199. The next prime is 112313221261. The reversal of 112313221223 is 322122313211.
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 112313221223 - 26 = 112313221159 is a prime.
It is a super-2 number, since 2×1123132212232 (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 (112313227223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 240833 + ... + 531626.
It is an arithmetic number, because the mean of its divisors is an integer number (16045539120).
Almost surely, 2112313221223 is an apocalyptic number.
112313221223 is a deficient number, since it is larger than the sum of its proper divisors (16051091737).
112313221223 is an equidigital number, since it uses as much as digits as its factorization.
112313221223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 793237.
The product of its digits is 864, while the sum is 23.
Adding to 112313221223 its reverse (322122313211), we get a palindrome (434435534434).
The spelling of 112313221223 in words is "one hundred twelve billion, three hundred thirteen million, two hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •