Base | Representation |
---|---|
bin | 11010011010010010000000… |
… | …100110000100100001011111 |
3 | 120020021100000022000202001212 |
4 | 122122102000212010201133 |
5 | 110211041424233013141 |
6 | 1051012553033455035 |
7 | 33315640311064511 |
oct | 3232220046044137 |
9 | 506240008022055 |
10 | 116155253016671 |
11 | 34013191191990 |
12 | 1103b7bb27147b |
13 | 4ca7516299a9b |
14 | 2097d31005bb1 |
15 | d666e850e2eb |
hex | 69a48098485f |
116155253016671 has 32 divisors (see below), whose sum is σ = 131244156334080. Its totient is φ = 101830176604800.
The previous prime is 116155253016637. The next prime is 116155253016727. The reversal of 116155253016671 is 176610352551611.
It is a cyclic number.
It is not a de Polignac number, because 116155253016671 - 234 = 116138073147487 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 (116155253018671) 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 31 ways as a sum of consecutive naturals, for example, 1200063740 + ... + 1200160526.
It is an arithmetic number, because the mean of its divisors is an integer number (4101379885440).
Almost surely, 2116155253016671 is an apocalyptic number.
116155253016671 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
116155253016671 is a deficient number, since it is larger than the sum of its proper divisors (15088903317409).
116155253016671 is a wasteful number, since it uses less digits than its factorization.
116155253016671 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101375.
The product of its (nonzero) digits is 1134000, while the sum is 50.
The spelling of 116155253016671 in words is "one hundred sixteen trillion, one hundred fifty-five billion, two hundred fifty-three million, sixteen thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •