Base | Representation |
---|---|
bin | 1101111011101… |
… | …11111111101000 |
3 | 22010221021221000 |
4 | 12331313333220 |
5 | 214410232212 |
6 | 15333115000 |
7 | 2616331011 |
oct | 675677750 |
9 | 263837830 |
10 | 116883432 |
11 | 5aa83286 |
12 | 33188a60 |
13 | 1b2a54c3 |
14 | 11748008 |
15 | a3dc1dc |
hex | 6f77fe8 |
116883432 has 128 divisors (see below), whose sum is σ = 347760000. Its totient is φ = 36246528.
The previous prime is 116883419. The next prime is 116883457. The reversal of 116883432 is 234388611.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a nude number because it is divisible by every one of its digits.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 510294 + ... + 510522.
It is an arithmetic number, because the mean of its divisors is an integer number (2716875).
Almost surely, 2116883432 is an apocalyptic number.
116883432 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 116883432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (173880000).
116883432 is an abundant number, since it is smaller than the sum of its proper divisors (230876568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116883432 is a wasteful number, since it uses less digits than its factorization.
116883432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 400 (or 390 counting only the distinct ones).
The product of its digits is 27648, while the sum is 36.
The square root of 116883432 is about 10811.2641259013. The cubic root of 116883432 is about 488.9348402018.
The spelling of 116883432 in words is "one hundred sixteen million, eight hundred eighty-three thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •