Base | Representation |
---|---|
bin | 1101110110101… |
… | …01010011100100 |
3 | 22002200102211120 |
4 | 12323111103210 |
5 | 214222421220 |
6 | 15310533540 |
7 | 2610554151 |
oct | 673252344 |
9 | 262612746 |
10 | 116217060 |
11 | 5a668663 |
12 | 32b072b0 |
13 | 1b1010bb |
14 | 11613228 |
15 | a309a40 |
hex | 6ed54e4 |
116217060 has 48 divisors (see below), whose sum is σ = 330003072. Its totient is φ = 30553600.
The previous prime is 116217019. The next prime is 116217067. The reversal of 116217060 is 60712611.
It is a self number, because there is not a number n which added to its sum of digits gives 116217060.
It is not an unprimeable number, because it can be changed into a prime (116217067) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9381 + ... + 17900.
It is an arithmetic number, because the mean of its divisors is an integer number (6875064).
Almost surely, 2116217060 is an apocalyptic number.
116217060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
116217060 is an abundant number, since it is smaller than the sum of its proper divisors (213786012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116217060 is a wasteful number, since it uses less digits than its factorization.
116217060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27364 (or 27362 counting only the distinct ones).
The product of its (nonzero) digits is 504, while the sum is 24.
The square root of 116217060 is about 10780.4016622759. The cubic root of 116217060 is about 488.0039023696.
Adding to 116217060 its reverse (60712611), we get a palindrome (176929671).
It can be divided in two parts, 11621 and 7060, that added together give a palindrome (18681).
The spelling of 116217060 in words is "one hundred sixteen million, two hundred seventeen thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •