Base | Representation |
---|---|
bin | 110100110010011101… |
… | …1101010000110011100 |
3 | 101211121102120012021020 |
4 | 1221210323222012130 |
5 | 3324131300311421 |
6 | 124024504004140 |
7 | 11122141303203 |
oct | 1514473520634 |
9 | 354542505236 |
10 | 113362510236 |
11 | 440931aa898 |
12 | 19b78a60650 |
13 | a8c8027931 |
14 | 56b59d223a |
15 | 2e373e6dc6 |
hex | 1a64eea19c |
113362510236 has 96 divisors (see below), whose sum is σ = 276556922880. Its totient is φ = 36108633600.
The previous prime is 113362510213. The next prime is 113362510259. The reversal of 113362510236 is 632015263311.
It is an interprime number because it is at equal distance from previous prime (113362510213) and next prime (113362510259).
It is a junction number, because it is equal to n+sod(n) for n = 113362510197 and 113362510206.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6691056 + ... + 6707976.
It is an arithmetic number, because the mean of its divisors is an integer number (2880801280).
Almost surely, 2113362510236 is an apocalyptic number.
It is an amenable number.
113362510236 is an abundant number, since it is smaller than the sum of its proper divisors (163194412644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113362510236 is a wasteful number, since it uses less digits than its factorization.
113362510236 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17235 (or 17233 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 33.
Adding to 113362510236 its reverse (632015263311), we get a palindrome (745377773547).
The spelling of 113362510236 in words is "one hundred thirteen billion, three hundred sixty-two million, five hundred ten thousand, two hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •