Base | Representation |
---|---|
bin | 1101110100010… |
… | …00100100010010 |
3 | 22002002110200000 |
4 | 12322020210102 |
5 | 214132341423 |
6 | 15300110430 |
7 | 2605104600 |
oct | 672104422 |
9 | 262073600 |
10 | 115902738 |
11 | 5a473496 |
12 | 32995416 |
13 | 1b021003 |
14 | 11570870 |
15 | a296843 |
hex | 6e88912 |
115902738 has 144 divisors (see below), whose sum is σ = 314705664. Its totient is φ = 31842720.
The previous prime is 115902713. The next prime is 115902749. The reversal of 115902738 is 837209511.
115902738 is a `hidden beast` number, since 11 + 590 + 27 + 38 = 666.
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 71 ways as a sum of consecutive naturals, for example, 738156 + ... + 738312.
It is an arithmetic number, because the mean of its divisors is an integer number (2185456).
Almost surely, 2115902738 is an apocalyptic number.
115902738 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 115902738, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157352832).
115902738 is an abundant number, since it is smaller than the sum of its proper divisors (198802926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115902738 is a wasteful number, since it uses less digits than its factorization.
115902738 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219 (or 200 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 36.
The square root of 115902738 is about 10765.8133924010. The cubic root of 115902738 is about 487.5635514783.
The spelling of 115902738 in words is "one hundred fifteen million, nine hundred two thousand, seven hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •