Base | Representation |
---|---|
bin | 1101111000000… |
… | …11011000010101 |
3 | 22010001000201020 |
4 | 12330003120111 |
5 | 214244441111 |
6 | 15314551353 |
7 | 2612301312 |
oct | 674033025 |
9 | 263030636 |
10 | 116405781 |
11 | 5a787428 |
12 | 32b98559 |
13 | 1b168c7b |
14 | 11661d09 |
15 | a345906 |
hex | 6f03615 |
116405781 has 8 divisors (see below), whose sum is σ = 155559840. Its totient is φ = 77427792.
The previous prime is 116405771. The next prime is 116405791. The reversal of 116405781 is 187504611.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (116405771) and next prime (116405791).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 116405781 - 26 = 116405717 is a prime.
It is a super-2 number, since 2×1164057812 = 27100611700439922, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116405701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42466 + ... + 45123.
It is an arithmetic number, because the mean of its divisors is an integer number (19444980).
Almost surely, 2116405781 is an apocalyptic number.
It is an amenable number.
116405781 is a deficient number, since it is larger than the sum of its proper divisors (39154059).
116405781 is an equidigital number, since it uses as much as digits as its factorization.
116405781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88035.
The product of its (nonzero) digits is 6720, while the sum is 33.
The square root of 116405781 is about 10789.1510787457. The cubic root of 116405781 is about 488.2679105927.
The spelling of 116405781 in words is "one hundred sixteen million, four hundred five thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •