Base | Representation |
---|---|
bin | 1101100010001… |
… | …11110001000110 |
3 | 21220122102211100 |
4 | 12301013301012 |
5 | 213031241131 |
6 | 15133320530 |
7 | 2546034615 |
oct | 661076106 |
9 | 256572740 |
10 | 113540166 |
11 | 590aa453 |
12 | 32036146 |
13 | 1a6a483c |
14 | 1111787c |
15 | 9e7b7e6 |
hex | 6c47c46 |
113540166 has 48 divisors (see below), whose sum is σ = 255191040. Its totient is φ = 36445680.
The previous prime is 113540123. The next prime is 113540171. The reversal of 113540166 is 661045311.
113540166 is a `hidden beast` number, since 113 + 540 + 1 + 6 + 6 = 666.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 157555 + ... + 158273.
It is an arithmetic number, because the mean of its divisors is an integer number (5316480).
Almost surely, 2113540166 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 113540166, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (127595520).
113540166 is an abundant number, since it is smaller than the sum of its proper divisors (141650874).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113540166 is a wasteful number, since it uses less digits than its factorization.
113540166 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1041 (or 1038 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 113540166 is about 10655.5227933687. The cubic root of 113540166 is about 484.2279366012.
Adding to 113540166 its reverse (661045311), we get a palindrome (774585477).
The spelling of 113540166 in words is "one hundred thirteen million, five hundred forty thousand, one hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •