Base | Representation |
---|---|
bin | 110100001111110111… |
… | …0000101001101000011 |
3 | 101201121111120210021211 |
4 | 1220133232011031003 |
5 | 3314242014321311 |
6 | 123313343430551 |
7 | 11051311340506 |
oct | 1503756051503 |
9 | 351544523254 |
10 | 112201323331 |
11 | 436477a3999 |
12 | 198b3bb5457 |
13 | a7715a29a6 |
14 | 56056c713d |
15 | 2dba4c6821 |
hex | 1a1fb85343 |
112201323331 has 8 divisors (see below), whose sum is σ = 119055802320. Its totient is φ = 105375111168.
The previous prime is 112201323319. The next prime is 112201323389. The reversal of 112201323331 is 133323102211.
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 112201323331 - 213 = 112201315139 is a prime.
It is a super-2 number, since 2×1122013233312 (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 (112201323431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7058526 + ... + 7074403.
It is an arithmetic number, because the mean of its divisors is an integer number (14881975290).
Almost surely, 2112201323331 is an apocalyptic number.
112201323331 is a deficient number, since it is larger than the sum of its proper divisors (6854478989).
112201323331 is a wasteful number, since it uses less digits than its factorization.
112201323331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14133413.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 112201323331 its reverse (133323102211), we get a palindrome (245524425542).
The spelling of 112201323331 in words is "one hundred twelve billion, two hundred one million, three hundred twenty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •