Base | Representation |
---|---|
bin | 110110000001100011… |
… | …0010100111001101101 |
3 | 102002110100202212212012 |
4 | 1230003012110321231 |
5 | 3400100110411432 |
6 | 125144055451005 |
7 | 11244662432231 |
oct | 1540306247155 |
9 | 362410685765 |
10 | 116016107117 |
11 | 45225082469 |
12 | 1a599686a65 |
13 | ac2ba151c1 |
14 | 58881c65c1 |
15 | 3040362cb2 |
hex | 1b03194e6d |
116016107117 has 4 divisors (see below), whose sum is σ = 118484534976. Its totient is φ = 113547679260.
The previous prime is 116016107107. The next prime is 116016107171. The reversal of 116016107117 is 711701610611.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 116016107117 - 24 = 116016107101 is a prime.
It is a super-2 number, since 2×1160161071172 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116016107107) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1234213859 + ... + 1234213952.
It is an arithmetic number, because the mean of its divisors is an integer number (29621133744).
Almost surely, 2116016107117 is an apocalyptic number.
It is an amenable number.
116016107117 is a deficient number, since it is larger than the sum of its proper divisors (2468427859).
116016107117 is an equidigital number, since it uses as much as digits as its factorization.
116016107117 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2468427858.
The product of its (nonzero) digits is 1764, while the sum is 32.
Adding to 116016107117 its reverse (711701610611), we get a palindrome (827717717728).
The spelling of 116016107117 in words is "one hundred sixteen billion, sixteen million, one hundred seven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •