Base | Representation |
---|---|
bin | 1101111010101… |
… | …11110101111100 |
3 | 22010200121021112 |
4 | 12331113311330 |
5 | 214342023430 |
6 | 15330221152 |
7 | 2615242040 |
oct | 675276574 |
9 | 263617245 |
10 | 116751740 |
11 | 5a9a3346 |
12 | 331247b8 |
13 | 1b25a591 |
14 | 11712020 |
15 | a3b3195 |
hex | 6f57d7c |
116751740 has 48 divisors (see below), whose sum is σ = 280857024. Its totient is φ = 39936000.
The previous prime is 116751731. The next prime is 116751763. The reversal of 116751740 is 47157611.
It is a Smith number, since the sum of its digits (32) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 116751697 and 116751706.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 89090 + ... + 90390.
It is an arithmetic number, because the mean of its divisors is an integer number (5851188).
Almost surely, 2116751740 is an apocalyptic number.
116751740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
116751740 is an abundant number, since it is smaller than the sum of its proper divisors (164105284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116751740 is a wasteful number, since it uses less digits than its factorization.
116751740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1958 (or 1956 counting only the distinct ones).
The product of its (nonzero) digits is 5880, while the sum is 32.
The square root of 116751740 is about 10805.1719097847. The cubic root of 116751740 is about 488.7511443514.
The spelling of 116751740 in words is "one hundred sixteen million, seven hundred fifty-one thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •