Base | Representation |
---|---|
bin | 110110001101110000… |
… | …0000110001000010011 |
3 | 102010111220010222122002 |
4 | 1230123200012020103 |
5 | 3401414412444124 |
6 | 125252442504215 |
7 | 11261063360624 |
oct | 1543340061023 |
9 | 363456128562 |
10 | 116425515539 |
11 | 45415194033 |
12 | 1a69280506b |
13 | ac9579bcc8 |
14 | 58c6719a4b |
15 | 30662840ae |
hex | 1b1b806213 |
116425515539 has 2 divisors, whose sum is σ = 116425515540. Its totient is φ = 116425515538.
The previous prime is 116425515443. The next prime is 116425515571. The reversal of 116425515539 is 935515524611.
It is a strong prime.
It is an emirp because it is prime and its reverse (935515524611) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116425515539 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 116425515493 and 116425515502.
It is not a weakly prime, because it can be changed into another prime (116425515589) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58212757769 + 58212757770.
It is an arithmetic number, because the mean of its divisors is an integer number (58212757770).
Almost surely, 2116425515539 is an apocalyptic number.
116425515539 is a deficient number, since it is larger than the sum of its proper divisors (1).
116425515539 is an equidigital number, since it uses as much as digits as its factorization.
116425515539 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 810000, while the sum is 47.
The spelling of 116425515539 in words is "one hundred sixteen billion, four hundred twenty-five million, five hundred fifteen thousand, five hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •