Base | Representation |
---|---|
bin | 1101011110111… |
… | …10110010111001 |
3 | 21212211121000201 |
4 | 12233132302321 |
5 | 212424011301 |
6 | 15120202201 |
7 | 2542264231 |
oct | 657366271 |
9 | 255747021 |
10 | 113110201 |
11 | 58936406 |
12 | 31a69361 |
13 | 1a583c19 |
14 | 11044cc1 |
15 | 9de4201 |
hex | 6bdecb9 |
113110201 has 4 divisors (see below), whose sum is σ = 113297152. Its totient is φ = 112923252.
The previous prime is 113110157. The next prime is 113110213. The reversal of 113110201 is 102011311.
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, and also an emirpimes, since its reverse is a distinct semiprime: 102011311 = 97 ⋅1051663.
It is a cyclic number.
It is not a de Polignac number, because 113110201 - 211 = 113108153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113110801) 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, 92565 + ... + 93778.
It is an arithmetic number, because the mean of its divisors is an integer number (28324288).
Almost surely, 2113110201 is an apocalyptic number.
It is an amenable number.
113110201 is a deficient number, since it is larger than the sum of its proper divisors (186951).
113110201 is an equidigital number, since it uses as much as digits as its factorization.
113110201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 186950.
The product of its (nonzero) digits is 6, while the sum is 10.
The square root of 113110201 is about 10635.3279686148. The cubic root of 113110201 is about 483.6159228430.
Adding to 113110201 its reverse (102011311), we get a palindrome (215121512).
It can be divided in two parts, 113110 and 201, that added together give a palindrome (113311).
The spelling of 113110201 in words is "one hundred thirteen million, one hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •