Base | Representation |
---|---|
bin | 110001101111011000… |
… | …0110001001110001101 |
3 | 101012201020011112101201 |
4 | 1203132300301032031 |
5 | 3222230013312311 |
6 | 121023145105501 |
7 | 10501004423401 |
oct | 1433660611615 |
9 | 335636145351 |
10 | 106816541581 |
11 | 41334175742 |
12 | 18850788291 |
13 | a0c3b005b9 |
14 | 52544a3101 |
15 | 2ba28b59c1 |
hex | 18dec3138d |
106816541581 has 2 divisors, whose sum is σ = 106816541582. Its totient is φ = 106816541580.
The previous prime is 106816541569. The next prime is 106816541593. The reversal of 106816541581 is 185145618601.
It is a balanced prime because it is at equal distance from previous prime (106816541569) and next prime (106816541593).
It can be written as a sum of positive squares in only one way, i.e., 63231628681 + 43584912900 = 251459^2 + 208770^2 .
It is a cyclic number.
It is not a de Polignac number, because 106816541581 - 25 = 106816541549 is a prime.
It is a super-2 number, since 2×1068165415812 (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 (106816551581) 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, 53408270790 + 53408270791.
It is an arithmetic number, because the mean of its divisors is an integer number (53408270791).
Almost surely, 2106816541581 is an apocalyptic number.
It is an amenable number.
106816541581 is a deficient number, since it is larger than the sum of its proper divisors (1).
106816541581 is an equidigital number, since it uses as much as digits as its factorization.
106816541581 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 230400, while the sum is 46.
The spelling of 106816541581 in words is "one hundred six billion, eight hundred sixteen million, five hundred forty-one thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •