Base | Representation |
---|---|
bin | 110100010010111001… |
… | …1001101111011111001 |
3 | 101201212121112102101220 |
4 | 1220211303031323321 |
5 | 3314444123124423 |
6 | 123331430102253 |
7 | 11053660403226 |
oct | 1504563157371 |
9 | 351777472356 |
10 | 112303333113 |
11 | 4369a3383a4 |
12 | 199221aa989 |
13 | a78976b1ca |
14 | 561507c94d |
15 | 2dc44269e3 |
hex | 1a25ccdef9 |
112303333113 has 4 divisors (see below), whose sum is σ = 149737777488. Its totient is φ = 74868888740.
The previous prime is 112303333111. The next prime is 112303333151. The reversal of 112303333113 is 311333303211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 112303333113 - 21 = 112303333111 is a prime.
It is a super-2 number, since 2×1123033331132 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (112303333111) 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, 18717222183 + ... + 18717222188.
It is an arithmetic number, because the mean of its divisors is an integer number (37434444372).
Almost surely, 2112303333113 is an apocalyptic number.
It is an amenable number.
112303333113 is a deficient number, since it is larger than the sum of its proper divisors (37434444375).
112303333113 is an equidigital number, since it uses as much as digits as its factorization.
112303333113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37434444374.
The product of its (nonzero) digits is 1458, while the sum is 24.
Adding to 112303333113 its reverse (311333303211), we get a palindrome (423636636324).
The spelling of 112303333113 in words is "one hundred twelve billion, three hundred three million, three hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •