Base | Representation |
---|---|
bin | 1101011111110… |
… | …00110010010001 |
3 | 21220001000001112 |
4 | 12233320302101 |
5 | 212440413112 |
6 | 15122343105 |
7 | 2543216501 |
oct | 657706221 |
9 | 256030045 |
10 | 113216657 |
11 | 589a9394 |
12 | 31abaa95 |
13 | 1a5c0508 |
14 | 11071a01 |
15 | 9e15a22 |
hex | 6bf8c91 |
113216657 has 4 divisors (see below), whose sum is σ = 114337716. Its totient is φ = 112095600.
The previous prime is 113216627. The next prime is 113216689. The reversal of 113216657 is 756612311.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 51609856 + 61606801 = 7184^2 + 7849^2 .
It is a cyclic number.
It is not a de Polignac number, because 113216657 - 210 = 113215633 is a prime.
It is a super-4 number, since 4×1132166574 (a number of 33 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113216627) 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, 560378 + ... + 560579.
It is an arithmetic number, because the mean of its divisors is an integer number (28584429).
Almost surely, 2113216657 is an apocalyptic number.
It is an amenable number.
113216657 is a deficient number, since it is larger than the sum of its proper divisors (1121059).
113216657 is a wasteful number, since it uses less digits than its factorization.
113216657 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1121058.
The product of its digits is 7560, while the sum is 32.
The square root of 113216657 is about 10640.3316207720. The cubic root of 113216657 is about 483.7675969713.
Adding to 113216657 its reverse (756612311), we get a palindrome (869828968).
The spelling of 113216657 in words is "one hundred thirteen million, two hundred sixteen thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •