Base | Representation |
---|---|
bin | 1101011111101… |
… | …00111111011011 |
3 | 21220000012201220 |
4 | 12233310333123 |
5 | 212434413430 |
6 | 15122143123 |
7 | 2543123256 |
oct | 657647733 |
9 | 256005656 |
10 | 113201115 |
11 | 58998745 |
12 | 31ab1aa3 |
13 | 1a5b6411 |
14 | 1106a09d |
15 | 9e11110 |
hex | 6bf4fdb |
113201115 has 8 divisors (see below), whose sum is σ = 181121808. Its totient is φ = 60373920.
The previous prime is 113201083. The next prime is 113201141. The reversal of 113201115 is 511102311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113201115 - 25 = 113201083 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15), and also a Moran number because the ratio is a prime number: 7546741 = 113201115 / (1 + 1 + 3 + 2 + 0 + 1 + 1 + 1 + 5).
It is a junction number, because it is equal to n+sod(n) for n = 113201094 and 113201103.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3773356 + ... + 3773385.
It is an arithmetic number, because the mean of its divisors is an integer number (22640226).
Almost surely, 2113201115 is an apocalyptic number.
113201115 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
113201115 is a deficient number, since it is larger than the sum of its proper divisors (67920693).
113201115 is an equidigital number, since it uses as much as digits as its factorization.
113201115 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7546749.
The product of its (nonzero) digits is 30, while the sum is 15.
The square root of 113201115 is about 10639.6012613255. The cubic root of 113201115 is about 483.7454592981.
Adding to 113201115 its reverse (511102311), we get a palindrome (624303426).
The spelling of 113201115 in words is "one hundred thirteen million, two hundred one thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •