Base | Representation |
---|---|
bin | 1101100011010… |
… | …01111101100011 |
3 | 21220220112221210 |
4 | 12301221331203 |
5 | 213100231402 |
6 | 15140321203 |
7 | 2550160143 |
oct | 661517543 |
9 | 256815853 |
10 | 113680227 |
11 | 59195701 |
12 | 320a3203 |
13 | 1a72350b |
14 | 11152923 |
15 | 9ea806c |
hex | 6c69f63 |
113680227 has 8 divisors (see below), whose sum is σ = 151641280. Its totient is φ = 75753000.
The previous prime is 113680223. The next prime is 113680267. The reversal of 113680227 is 722086311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113680227 - 22 = 113680223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113680194 and 113680203.
It is not an unprimeable number, because it can be changed into a prime (113680223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 852 + ... + 15102.
It is an arithmetic number, because the mean of its divisors is an integer number (18955160).
Almost surely, 2113680227 is an apocalyptic number.
113680227 is a deficient number, since it is larger than the sum of its proper divisors (37961053).
113680227 is a wasteful number, since it uses less digits than its factorization.
113680227 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16913.
The product of its (nonzero) digits is 4032, while the sum is 30.
The square root of 113680227 is about 10662.0929934042. The cubic root of 113680227 is about 484.4269662567.
The spelling of 113680227 in words is "one hundred thirteen million, six hundred eighty thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •