Base | Representation |
---|---|
bin | 1101100000011… |
… | …11111100110000 |
3 | 21220012211012120 |
4 | 12300033330300 |
5 | 213001432121 |
6 | 15124354240 |
7 | 2544063222 |
oct | 660177460 |
9 | 256184176 |
10 | 113311536 |
11 | 58a636a8 |
12 | 31b45980 |
13 | 1a624760 |
14 | 11098412 |
15 | 9e33bc6 |
hex | 6c0ff30 |
113311536 has 160 divisors (see below), whose sum is σ = 333645312. Its totient is φ = 32901120.
The previous prime is 113311531. The next prime is 113311537. The reversal of 113311536 is 635113311.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (113311531) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1100061 + ... + 1100163.
Almost surely, 2113311536 is an apocalyptic number.
113311536 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 113311536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166822656).
113311536 is an abundant number, since it is smaller than the sum of its proper divisors (220333776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113311536 is a wasteful number, since it uses less digits than its factorization.
113311536 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 211 (or 205 counting only the distinct ones).
The product of its digits is 810, while the sum is 24.
The square root of 113311536 is about 10644.7891477474. The cubic root of 113311536 is about 483.9026965563.
Adding to 113311536 its reverse (635113311), we get a palindrome (748424847).
The spelling of 113311536 in words is "one hundred thirteen million, three hundred eleven thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •