Base | Representation |
---|---|
bin | 110110001101011101… |
… | …1110110000011111101 |
3 | 102010111020021011222012 |
4 | 1230122323312003331 |
5 | 3401404444400131 |
6 | 125251503101005 |
7 | 11260616531243 |
oct | 1543273660375 |
9 | 363436234865 |
10 | 116416012541 |
11 | 4540a893314 |
12 | 1a68b5a1765 |
13 | ac9382272a |
14 | 58c5364793 |
15 | 306550852b |
hex | 1b1aef60fd |
116416012541 has 2 divisors, whose sum is σ = 116416012542. Its totient is φ = 116416012540.
The previous prime is 116416012523. The next prime is 116416012607. The reversal of 116416012541 is 145210614611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 116015172100 + 400840441 = 340610^2 + 20021^2 .
It is an emirp because it is prime and its reverse (145210614611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 116416012541 - 226 = 116348903677 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 116416012498 and 116416012507.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116416002541) 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 as a sum of consecutive naturals, namely, 58208006270 + 58208006271.
It is an arithmetic number, because the mean of its divisors is an integer number (58208006271).
Almost surely, 2116416012541 is an apocalyptic number.
It is an amenable number.
116416012541 is a deficient number, since it is larger than the sum of its proper divisors (1).
116416012541 is an equidigital number, since it uses as much as digits as its factorization.
116416012541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 32.
The spelling of 116416012541 in words is "one hundred sixteen billion, four hundred sixteen million, twelve thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •