Base | Representation |
---|---|
bin | 110110010011000001… |
… | …1010101101011101011 |
3 | 102010222020020001221111 |
4 | 1230212003111223223 |
5 | 3402300221321233 |
6 | 125322204451151 |
7 | 11265343056454 |
oct | 1544603255353 |
9 | 363866201844 |
10 | 116602526443 |
11 | 454a60a4a37 |
12 | 1a721b49ab7 |
13 | acc33674a0 |
14 | 590203612b |
15 | 3076a9bacd |
hex | 1b260d5aeb |
116602526443 has 4 divisors (see below), whose sum is σ = 125571951568. Its totient is φ = 107633101320.
The previous prime is 116602526303. The next prime is 116602526471. The reversal of 116602526443 is 344625206611.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 116602526443 - 213 = 116602518251 is a prime.
It is a super-2 number, since 2×1166025264432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 116602526396 and 116602526405.
It is not an unprimeable number, because it can be changed into a prime (116602526143) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4484712543 + ... + 4484712568.
It is an arithmetic number, because the mean of its divisors is an integer number (31392987892).
Almost surely, 2116602526443 is an apocalyptic number.
116602526443 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
116602526443 is a deficient number, since it is larger than the sum of its proper divisors (8969425125).
116602526443 is an equidigital number, since it uses as much as digits as its factorization.
116602526443 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8969425124.
The product of its (nonzero) digits is 207360, while the sum is 40.
The spelling of 116602526443 in words is "one hundred sixteen billion, six hundred two million, five hundred twenty-six thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •