Base | Representation |
---|---|
bin | 1101110111110… |
… | …11111111101100 |
3 | 22002222111012220 |
4 | 12323323333230 |
5 | 214243004112 |
6 | 15314155340 |
7 | 2612114160 |
oct | 673737754 |
9 | 262874186 |
10 | 116375532 |
11 | 5a766729 |
12 | 32b82b50 |
13 | 1b158280 |
14 | 11654ca0 |
15 | a33b98c |
hex | 6efbfec |
116375532 has 192 divisors, whose sum is σ = 361267200. Its totient is φ = 28304640.
The previous prime is 116375531. The next prime is 116375537. The reversal of 116375532 is 235573611.
It is a junction number, because it is equal to n+sod(n) for n = 116375493 and 116375502.
It is not an unprimeable number, because it can be changed into a prime (116375531) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1473069 + ... + 1473147.
It is an arithmetic number, because the mean of its divisors is an integer number (1881600).
Almost surely, 2116375532 is an apocalyptic number.
116375532 is a gapful number since it is divisible by the number (12) 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 116375532, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (180633600).
116375532 is an abundant number, since it is smaller than the sum of its proper divisors (244891668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116375532 is a wasteful number, since it uses less digits than its factorization.
116375532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196 (or 194 counting only the distinct ones).
The product of its digits is 18900, while the sum is 33.
The square root of 116375532 is about 10787.7491628235. The cubic root of 116375532 is about 488.2256134507.
The spelling of 116375532 in words is "one hundred sixteen million, three hundred seventy-five thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •