Base | Representation |
---|---|
bin | 11010011000111001110111… |
… | …001100100101100001000011 |
3 | 120012221021201012002012121211 |
4 | 122120321313030211201003 |
5 | 110203014110122414421 |
6 | 1050501301213030551 |
7 | 33306050004166222 |
oct | 3230716714454103 |
9 | 505837635065554 |
10 | 116060606060611 |
11 | 33a87032477a43 |
12 | 110253a6185457 |
13 | 4c9b6117c9784 |
14 | 2093512ca6cb9 |
15 | d640092169e1 |
hex | 698e77325843 |
116060606060611 has 8 divisors (see below), whose sum is σ = 120132378330480. Its totient is φ = 111993479284512.
The previous prime is 116060606060599. The next prime is 116060606060647.
116060606060611 is nontrivially palindromic in base 10.
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 116060606060611 - 29 = 116060606060099 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (116060606060911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1161322600 + ... + 1161422533.
It is an arithmetic number, because the mean of its divisors is an integer number (15016547291310).
Almost surely, 2116060606060611 is an apocalyptic number.
116060606060611 is a deficient number, since it is larger than the sum of its proper divisors (4071772269869).
116060606060611 is a wasteful number, since it uses less digits than its factorization.
116060606060611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2322746885.
The product of its (nonzero) digits is 46656, while the sum is 40.
It can be divided in two parts, 11606060 and 6060611, that added together give a palindrome (17666671).
The spelling of 116060606060611 in words is "one hundred sixteen trillion, sixty billion, six hundred six million, sixty thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •