Base | Representation |
---|---|
bin | 1101111001010… |
… | …01110100100000 |
3 | 22010100000200202 |
4 | 12330221310200 |
5 | 214320010412 |
6 | 15322204332 |
7 | 2613525332 |
oct | 674516440 |
9 | 263300622 |
10 | 116563232 |
11 | 5a884755 |
12 | 330536a8 |
13 | 1b1c2836 |
14 | 116a3452 |
15 | a3773c2 |
hex | 6f29d20 |
116563232 has 48 divisors (see below), whose sum is σ = 235962720. Its totient is φ = 56659968.
The previous prime is 116563231. The next prime is 116563247. The reversal of 116563232 is 232365611.
It is a junction number, because it is equal to n+sod(n) for n = 116563195 and 116563204.
It is not an unprimeable number, because it can be changed into a prime (116563231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 201728 + ... + 202304.
It is an arithmetic number, because the mean of its divisors is an integer number (4915890).
Almost surely, 2116563232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 116563232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (117981360).
116563232 is an abundant number, since it is smaller than the sum of its proper divisors (119399488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116563232 is a wasteful number, since it uses less digits than its factorization.
116563232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 753 (or 745 counting only the distinct ones).
The product of its digits is 6480, while the sum is 29.
The square root of 116563232 is about 10796.4453409444. The cubic root of 116563232 is about 488.4879558923.
The spelling of 116563232 in words is "one hundred sixteen million, five hundred sixty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •