Base | Representation |
---|---|
bin | 1101011110011… |
… | …01101101010011 |
3 | 21212201001000111 |
4 | 12233031231103 |
5 | 212414241321 |
6 | 15114502151 |
7 | 2541553204 |
oct | 657155523 |
9 | 255631014 |
10 | 113040211 |
11 | 58898869 |
12 | 31a34957 |
13 | 1a55b0cb |
14 | 110275ab |
15 | 9dcd5e1 |
hex | 6bcdb53 |
113040211 has 4 divisors (see below), whose sum is σ = 114205672. Its totient is φ = 111874752.
The previous prime is 113040203. The next prime is 113040223. The reversal of 113040211 is 112040311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 113040211 - 23 = 113040203 is a prime.
It is a super-3 number, since 3×1130402113 (a number of 25 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113040191 and 113040200.
It is not an unprimeable number, because it can be changed into a prime (113040241) 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 3 ways as a sum of consecutive naturals, for example, 582585 + ... + 582778.
It is an arithmetic number, because the mean of its divisors is an integer number (28551418).
Almost surely, 2113040211 is an apocalyptic number.
113040211 is a deficient number, since it is larger than the sum of its proper divisors (1165461).
113040211 is an equidigital number, since it uses as much as digits as its factorization.
113040211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1165460.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 113040211 is about 10632.0370108460. The cubic root of 113040211 is about 483.5161521118.
Adding to 113040211 its reverse (112040311), we get a palindrome (225080522).
The spelling of 113040211 in words is "one hundred thirteen million, forty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •