Base | Representation |
---|---|
bin | 1101111001101… |
… | …01101011110111 |
3 | 22010102111100201 |
4 | 12330311223313 |
5 | 214323034311 |
6 | 15323221331 |
7 | 2614120120 |
oct | 674655367 |
9 | 263374321 |
10 | 116611831 |
11 | 5a908216 |
12 | 33077847 |
13 | 1b20b9ab |
14 | 116b7047 |
15 | a3869c1 |
hex | 6f35af7 |
116611831 has 8 divisors (see below), whose sum is σ = 136521504. Its totient is φ = 97514880.
The previous prime is 116611793. The next prime is 116611853. The reversal of 116611831 is 138116611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 116611831 - 223 = 108223223 is a prime.
It is a super-2 number, since 2×1166118312 = 27196638258345122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 116611831.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116612831) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 202870 + ... + 203443.
It is an arithmetic number, because the mean of its divisors is an integer number (17065188).
Almost surely, 2116611831 is an apocalyptic number.
116611831 is a deficient number, since it is larger than the sum of its proper divisors (19909673).
116611831 is an equidigital number, since it uses as much as digits as its factorization.
116611831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 406361.
The product of its digits is 864, while the sum is 28.
The square root of 116611831 is about 10798.6958008826. The cubic root of 116611831 is about 488.5558352947. Note that the first 3 decimals are identical.
The spelling of 116611831 in words is "one hundred sixteen million, six hundred eleven thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •