Base | Representation |
---|---|
bin | 110110000100011001… |
… | …0010010000110110001 |
3 | 102002201000022011100112 |
4 | 1230020302102012301 |
5 | 3400244022003311 |
6 | 125201344431105 |
7 | 11250231413411 |
oct | 1541062220661 |
9 | 362630264315 |
10 | 116111516081 |
11 | 45273a18650 |
12 | 1a605618495 |
13 | ac4570c102 |
14 | 5896b40641 |
15 | 304890c28b |
hex | 1b08c921b1 |
116111516081 has 16 divisors (see below), whose sum is σ = 127878905088. Its totient is φ = 104549187600.
The previous prime is 116111516063. The next prime is 116111516093. The reversal of 116111516081 is 180615111611.
It is a de Polignac number, because none of the positive numbers 2k-116111516081 is a prime.
It is a super-2 number, since 2×1161115160812 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (116111516011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 676610 + ... + 830676.
It is an arithmetic number, because the mean of its divisors is an integer number (7992431568).
Almost surely, 2116111516081 is an apocalyptic number.
116111516081 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
116111516081 is a deficient number, since it is larger than the sum of its proper divisors (11767389007).
116111516081 is a wasteful number, since it uses less digits than its factorization.
116111516081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154732.
The product of its (nonzero) digits is 1440, while the sum is 32.
Adding to 116111516081 its reverse (180615111611), we get a palindrome (296726627692).
The spelling of 116111516081 in words is "one hundred sixteen billion, one hundred eleven million, five hundred sixteen thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •