Base | Representation |
---|---|
bin | 11010100001001000111011… |
… | …000101110100000100001101 |
3 | 120021221101110122002110221002 |
4 | 122201020323011310010031 |
5 | 110241302120013212214 |
6 | 1052013253442350045 |
7 | 33364663134514544 |
oct | 3241107305640415 |
9 | 507841418073832 |
10 | 116626533335309 |
11 | 34185042690728 |
12 | 110b700605b325 |
13 | 500cab138935a |
14 | 20b2a7bc5b15b |
15 | d73accb1c1de |
hex | 6a123b17410d |
116626533335309 has 2 divisors, whose sum is σ = 116626533335310. Its totient is φ = 116626533335308.
The previous prime is 116626533335303. The next prime is 116626533335369. The reversal of 116626533335309 is 903533335626611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110825034858409 + 5801498476900 = 10527347^2 + 2408630^2 .
It is a cyclic number.
It is not a de Polignac number, because 116626533335309 - 228 = 116626264899853 is a prime.
It is a super-2 number, since 2×1166265333353092 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116626533335303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58313266667654 + 58313266667655.
It is an arithmetic number, because the mean of its divisors is an integer number (58313266667655).
Almost surely, 2116626533335309 is an apocalyptic number.
It is an amenable number.
116626533335309 is a deficient number, since it is larger than the sum of its proper divisors (1).
116626533335309 is an equidigital number, since it uses as much as digits as its factorization.
116626533335309 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23619600, while the sum is 56.
The spelling of 116626533335309 in words is "one hundred sixteen trillion, six hundred twenty-six billion, five hundred thirty-three million, three hundred thirty-five thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •