Base | Representation |
---|---|
bin | 1101011110001… |
… | …10010111000001 |
3 | 21212122111201202 |
4 | 12233012113001 |
5 | 212412310423 |
6 | 15114110545 |
7 | 2541366356 |
oct | 657062701 |
9 | 255574652 |
10 | 113010113 |
11 | 58878197 |
12 | 31a1b455 |
13 | 1a54a4b8 |
14 | 1101a62d |
15 | 9dc4728 |
hex | 6bc65c1 |
113010113 has 4 divisors (see below), whose sum is σ = 113036208. Its totient is φ = 112984020.
The previous prime is 113010091. The next prime is 113010133. The reversal of 113010113 is 311010311.
It is a happy number.
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: 311010311 = 1483 ⋅209717.
It is a cyclic number.
It is not a de Polignac number, because 113010113 - 26 = 113010049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113010094 and 113010103.
It is not an unprimeable number, because it can be changed into a prime (113010133) 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, 4823 + ... + 15788.
It is an arithmetic number, because the mean of its divisors is an integer number (28259052).
Almost surely, 2113010113 is an apocalyptic number.
It is an amenable number.
113010113 is a deficient number, since it is larger than the sum of its proper divisors (26095).
113010113 is an equidigital number, since it uses as much as digits as its factorization.
113010113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26094.
The product of its (nonzero) digits is 9, while the sum is 11.
The square root of 113010113 is about 10630.6214775995. The cubic root of 113010113 is about 483.4732347558.
Adding to 113010113 its reverse (311010311), we get a palindrome (424020424).
The spelling of 113010113 in words is "one hundred thirteen million, ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •