Base | Representation |
---|---|
bin | 110110000101010101… |
… | …1101100000000101011 |
3 | 102002210020012001202212 |
4 | 1230022223230000223 |
5 | 3400330143412421 |
6 | 125204442515335 |
7 | 11251066054253 |
oct | 1541253540053 |
9 | 362706161685 |
10 | 116143341611 |
11 | 4528a985640 |
12 | 1a614205b4b |
13 | ac4c1a2c9b |
14 | 589b066963 |
15 | 304b5e6e5b |
hex | 1b0aaec02b |
116143341611 has 4 divisors (see below), whose sum is σ = 126701827224. Its totient is φ = 105584856000.
The previous prime is 116143341583. The next prime is 116143341619.
116143341611 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 116143341611 - 230 = 115069599787 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (116143341619) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5279242790 + ... + 5279242811.
It is an arithmetic number, because the mean of its divisors is an integer number (31675456806).
Almost surely, 2116143341611 is an apocalyptic number.
116143341611 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
116143341611 is a deficient number, since it is larger than the sum of its proper divisors (10558485613).
116143341611 is a wasteful number, since it uses less digits than its factorization.
116143341611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10558485612.
The product of its digits is 5184, while the sum is 32.
It can be divided in two parts, 116143 and 341611, that added together give a palindrome (457754).
The spelling of 116143341611 in words is "one hundred sixteen billion, one hundred forty-three million, three hundred forty-one thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •