Base | Representation |
---|---|
bin | 1101110010001… |
… | …10001010010000 |
3 | 22001120122112212 |
4 | 12321012022100 |
5 | 214100140421 |
6 | 15250211252 |
7 | 2602562564 |
oct | 671061220 |
9 | 261518485 |
10 | 115630736 |
11 | 5a2a80a1 |
12 | 32883b28 |
13 | 1ac57270 |
14 | 114dd6a4 |
15 | a240e5b |
hex | 6e46290 |
115630736 has 80 divisors (see below), whose sum is σ = 260702064. Its totient is φ = 49201152.
The previous prime is 115630721. The next prime is 115630747. The reversal of 115630736 is 637036511.
It can be written as a sum of positive squares in 8 ways, for example, as 6553600 + 109077136 = 2560^2 + 10444^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 187100 + ... + 187716.
Almost surely, 2115630736 is an apocalyptic number.
115630736 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 115630736, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (130351032).
115630736 is an abundant number, since it is smaller than the sum of its proper divisors (145071328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115630736 is a wasteful number, since it uses less digits than its factorization.
115630736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 708 (or 702 counting only the distinct ones).
The product of its (nonzero) digits is 11340, while the sum is 32.
The square root of 115630736 is about 10753.1732990778. The cubic root of 115630736 is about 487.1818459716.
The spelling of 115630736 in words is "one hundred fifteen million, six hundred thirty thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •