Base | Representation |
---|---|
bin | 11010011001001000011010… |
… | …111000100001010010010001 |
3 | 120012222210001112202121202102 |
4 | 122121020122320201102101 |
5 | 110203243113203300323 |
6 | 1050512404233530145 |
7 | 33310142236325216 |
oct | 3231103270412221 |
9 | 505883045677672 |
10 | 116076237165713 |
11 | 33a92723862620 |
12 | 11028428b73955 |
13 | 4c9cc330123a6 |
14 | 2094196c4db0d |
15 | d64621640328 |
hex | 69921ae21491 |
116076237165713 has 8 divisors (see below), whose sum is σ = 127076073328416. Its totient is φ = 105150976164000.
The previous prime is 116076237165683. The next prime is 116076237165737. The reversal of 116076237165713 is 317561732670611.
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 116076237165713 - 218 = 116076236903569 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (116076237165743) 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, 18643786988 + ... + 18643793213.
It is an arithmetic number, because the mean of its divisors is an integer number (15884509166052).
Almost surely, 2116076237165713 is an apocalyptic number.
It is an amenable number.
116076237165713 is a deficient number, since it is larger than the sum of its proper divisors (10999836162703).
116076237165713 is a wasteful number, since it uses less digits than its factorization.
116076237165713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37287580495.
The product of its (nonzero) digits is 6667920, while the sum is 56.
The spelling of 116076237165713 in words is "one hundred sixteen trillion, seventy-six billion, two hundred thirty-seven million, one hundred sixty-five thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •