Base | Representation |
---|---|
bin | 1101111001001… |
… | …10111111101000 |
3 | 22010022102211000 |
4 | 12330212333220 |
5 | 214314123111 |
6 | 15322035000 |
7 | 2613446514 |
oct | 674467750 |
9 | 263272730 |
10 | 116551656 |
11 | 5a876a91 |
12 | 33048a60 |
13 | 1b1ba4a0 |
14 | 1169d144 |
15 | a373c56 |
hex | 6f26fe8 |
116551656 has 64 divisors (see below), whose sum is σ = 348667200. Its totient is φ = 35861184.
The previous prime is 116551651. The next prime is 116551679. The reversal of 116551656 is 656155611.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 116551656.
It is not an unprimeable number, because it can be changed into a prime (116551651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17946 + ... + 23561.
It is an arithmetic number, because the mean of its divisors is an integer number (5447925).
Almost surely, 2116551656 is an apocalyptic number.
It is an amenable number.
116551656 is an abundant number, since it is smaller than the sum of its proper divisors (232115544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116551656 is a wasteful number, since it uses less digits than its factorization.
116551656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41535 (or 41525 counting only the distinct ones).
The product of its digits is 27000, while the sum is 36.
The square root of 116551656 is about 10795.9092252575. The cubic root of 116551656 is about 488.4717846300.
The spelling of 116551656 in words is "one hundred sixteen million, five hundred fifty-one thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •