Base | Representation |
---|---|
bin | 1101100000011… |
… | …01101011000011 |
3 | 21220012100102012 |
4 | 12300031223003 |
5 | 213001132321 |
6 | 15124243135 |
7 | 2544024101 |
oct | 660155303 |
9 | 256170365 |
10 | 113302211 |
11 | 58a576a0 |
12 | 31b404ab |
13 | 1a620439 |
14 | 11094c71 |
15 | 9e3105b |
hex | 6c0dac3 |
113302211 has 4 divisors (see below), whose sum is σ = 123602424. Its totient is φ = 103002000.
The previous prime is 113302207. The next prime is 113302213. The reversal of 113302211 is 112203311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 112203311 = 11 ⋅10200301.
It is a cyclic number.
It is not a de Polignac number, because 113302211 - 22 = 113302207 is a prime.
It is not an unprimeable number, because it can be changed into a prime (113302213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5150090 + ... + 5150111.
It is an arithmetic number, because the mean of its divisors is an integer number (30900606).
Almost surely, 2113302211 is an apocalyptic number.
113302211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
113302211 is a deficient number, since it is larger than the sum of its proper divisors (10300213).
113302211 is a wasteful number, since it uses less digits than its factorization.
113302211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10300212.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 113302211 is about 10644.3511309990. The cubic root of 113302211 is about 483.8894218960.
Adding to 113302211 its reverse (112203311), we get a palindrome (225505522).
The spelling of 113302211 in words is "one hundred thirteen million, three hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •