Base | Representation |
---|---|
bin | 110110011101000001… |
… | …0000110101110101101 |
3 | 102011211121000001121111 |
4 | 1230322002012232231 |
5 | 3403442030403443 |
6 | 125415341432021 |
7 | 11306553311116 |
oct | 1547202065655 |
9 | 364747001544 |
10 | 116937747373 |
11 | 45658345427 |
12 | 1a7b626b611 |
13 | b047947775 |
14 | 593477720d |
15 | 309621669d |
hex | 1b3a086bad |
116937747373 has 2 divisors, whose sum is σ = 116937747374. Its totient is φ = 116937747372.
The previous prime is 116937747343. The next prime is 116937747419. The reversal of 116937747373 is 373747739611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 115343102884 + 1594644489 = 339622^2 + 39933^2 .
It is an emirp because it is prime and its reverse (373747739611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 116937747373 - 25 = 116937747341 is a prime.
It is a super-2 number, since 2×1169377473732 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116937747343) 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 as a sum of consecutive naturals, namely, 58468873686 + 58468873687.
It is an arithmetic number, because the mean of its divisors is an integer number (58468873687).
Almost surely, 2116937747373 is an apocalyptic number.
It is an amenable number.
116937747373 is a deficient number, since it is larger than the sum of its proper divisors (1).
116937747373 is an equidigital number, since it uses as much as digits as its factorization.
116937747373 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14002632, while the sum is 58.
The spelling of 116937747373 in words is "one hundred sixteen billion, nine hundred thirty-seven million, seven hundred forty-seven thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •