Base | Representation |
---|---|
bin | 11010011100101110010110… |
… | …111000111011101011101101 |
3 | 120020212101022222122221221101 |
4 | 122130232112320323223231 |
5 | 110221314232440100433 |
6 | 1051222035241003101 |
7 | 33334032422422033 |
oct | 3234562670735355 |
9 | 506771288587841 |
10 | 116323130784493 |
11 | 340783a9876666 |
12 | 11068251183491 |
13 | 4cba2bb650889 |
14 | 20a20d8c86553 |
15 | d6ac718a007d |
hex | 69cb96e3baed |
116323130784493 has 2 divisors, whose sum is σ = 116323130784494. Its totient is φ = 116323130784492.
The previous prime is 116323130784467. The next prime is 116323130784533. The reversal of 116323130784493 is 394487031323611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97530576323049 + 18792554461444 = 9875757^2 + 4335038^2 .
It is a cyclic number.
It is not a de Polignac number, because 116323130784493 - 217 = 116323130653421 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116323133784493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58161565392246 + 58161565392247.
It is an arithmetic number, because the mean of its divisors is an integer number (58161565392247).
Almost surely, 2116323130784493 is an apocalyptic number.
It is an amenable number.
116323130784493 is a deficient number, since it is larger than the sum of its proper divisors (1).
116323130784493 is an equidigital number, since it uses as much as digits as its factorization.
116323130784493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7838208, while the sum is 55.
The spelling of 116323130784493 in words is "one hundred sixteen trillion, three hundred twenty-three billion, one hundred thirty million, seven hundred eighty-four thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •