Base | Representation |
---|---|
bin | 110110010011011001… |
… | …1110110011110000101 |
3 | 102011000010011011200021 |
4 | 1230212303312132011 |
5 | 3402312000244103 |
6 | 125323341215141 |
7 | 11265556134046 |
oct | 1544663663605 |
9 | 364003134607 |
10 | 116615243653 |
11 | 455022a0627 |
12 | 1a7262614b1 |
13 | acc5b9aa6c |
14 | 59039c68cd |
15 | 3077c5ebbd |
hex | 1b26cf6785 |
116615243653 has 2 divisors, whose sum is σ = 116615243654. Its totient is φ = 116615243652.
The previous prime is 116615243611. The next prime is 116615243681. The reversal of 116615243653 is 356342516611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105952203009 + 10663040644 = 325503^2 + 103262^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116615243653 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116615243603) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58307621826 + 58307621827.
It is an arithmetic number, because the mean of its divisors is an integer number (58307621827).
Almost surely, 2116615243653 is an apocalyptic number.
It is an amenable number.
116615243653 is a deficient number, since it is larger than the sum of its proper divisors (1).
116615243653 is an equidigital number, since it uses as much as digits as its factorization.
116615243653 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 388800, while the sum is 43.
The spelling of 116615243653 in words is "one hundred sixteen billion, six hundred fifteen million, two hundred forty-three thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •