Base | Representation |
---|---|
bin | 110100101101101010… |
… | …0011001000111011111 |
3 | 101211012012001220112222 |
4 | 1221123110121013133 |
5 | 3323314003101421 |
6 | 124000503015555 |
7 | 11115142340345 |
oct | 1513324310737 |
9 | 354165056488 |
10 | 113201222111 |
11 | 4401015871a |
12 | 19b32a3a5bb |
13 | a8a07a5a83 |
14 | 569c409995 |
15 | 2e28187cab |
hex | 1a5b5191df |
113201222111 has 4 divisors (see below), whose sum is σ = 113210218224. Its totient is φ = 113192226000.
The previous prime is 113201222107. The next prime is 113201222117. The reversal of 113201222111 is 111222102311.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 111222102311 = 83563 ⋅1330997.
It is a cyclic number.
It is not a de Polignac number, because 113201222111 - 22 = 113201222107 is a prime.
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 113201222111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113201222117) 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, 4479155 + ... + 4504356.
It is an arithmetic number, because the mean of its divisors is an integer number (28302554556).
Almost surely, 2113201222111 is an apocalyptic number.
113201222111 is a deficient number, since it is larger than the sum of its proper divisors (8996113).
113201222111 is an equidigital number, since it uses as much as digits as its factorization.
113201222111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8996112.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 113201222111 its reverse (111222102311), we get a palindrome (224423324422).
The spelling of 113201222111 in words is "one hundred thirteen billion, two hundred one million, two hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •