Base | Representation |
---|---|
bin | 110110001101011111… |
… | …0001001000011010011 |
3 | 102010111021101202212002 |
4 | 1230122332021003103 |
5 | 3401410123131421 |
6 | 125251524024215 |
7 | 11260624616453 |
oct | 1543276110323 |
9 | 363437352762 |
10 | 116416614611 |
11 | 454101646a0 |
12 | 1a68b83206b |
13 | ac939a379b |
14 | 58c547dd63 |
15 | 30655c6b0b |
hex | 1b1af890d3 |
116416614611 has 8 divisors (see below), whose sum is σ = 127472065200. Its totient is φ = 105439851040.
The previous prime is 116416614527. The next prime is 116416614623.
116416614611 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 116416614611 - 226 = 116349505747 is a prime.
It is a super-3 number, since 3×1164166146113 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (116416614641) 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, 19668656 + ... + 19674573.
It is an arithmetic number, because the mean of its divisors is an integer number (15934008150).
Almost surely, 2116416614611 is an apocalyptic number.
116416614611 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
116416614611 is a deficient number, since it is larger than the sum of its proper divisors (11055450589).
116416614611 is a wasteful number, since it uses less digits than its factorization.
116416614611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39343509.
The product of its digits is 20736, while the sum is 38.
The spelling of 116416614611 in words is "one hundred sixteen billion, four hundred sixteen million, six hundred fourteen thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •