Base | Representation |
---|---|
bin | 110110000010010100… |
… | …1001100110001111111 |
3 | 102002112011112201000221 |
4 | 1230010221030301333 |
5 | 3400123224313421 |
6 | 125150423202211 |
7 | 11245425642634 |
oct | 1540451146177 |
9 | 362464481027 |
10 | 116042026111 |
11 | 45238775820 |
12 | 1a5a62a6367 |
13 | ac341bb79b |
14 | 588b81218b |
15 | 3042782841 |
hex | 1b04a4cc7f |
116042026111 has 8 divisors (see below), whose sum is σ = 126669415248. Its totient is φ = 105427656000.
The previous prime is 116042026069. The next prime is 116042026127. The reversal of 116042026111 is 111620240611.
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 116042026111 - 221 = 116039928959 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116042026211) 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, 3236110 + ... + 3271771.
It is an arithmetic number, because the mean of its divisors is an integer number (15833676906).
Almost surely, 2116042026111 is an apocalyptic number.
116042026111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
116042026111 is a deficient number, since it is larger than the sum of its proper divisors (10627389137).
116042026111 is a wasteful number, since it uses less digits than its factorization.
116042026111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6509513.
The product of its (nonzero) digits is 576, while the sum is 25.
Adding to 116042026111 its reverse (111620240611), we get a palindrome (227662266722).
The spelling of 116042026111 in words is "one hundred sixteen billion, forty-two million, twenty-six thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •