Base | Representation |
---|---|
bin | 110001100110101101… |
… | …0111101010000001011 |
3 | 101011221221201201200201 |
4 | 1203031122331100023 |
5 | 3221131024023034 |
6 | 120534233313031 |
7 | 10460542516342 |
oct | 1431532752013 |
9 | 334857651621 |
10 | 106525611019 |
11 | 411a4a26263 |
12 | 1878b265777 |
13 | a078759939 |
14 | 52279b0b59 |
15 | 2b87099014 |
hex | 18cd6bd40b |
106525611019 has 2 divisors, whose sum is σ = 106525611020. Its totient is φ = 106525611018.
The previous prime is 106525611007. The next prime is 106525611043. The reversal of 106525611019 is 910116525601.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 106525611019 - 233 = 97935676427 is a prime.
It is a super-2 number, since 2×1065256110192 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (106525611119) 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, 53262805509 + 53262805510.
It is an arithmetic number, because the mean of its divisors is an integer number (53262805510).
Almost surely, 2106525611019 is an apocalyptic number.
106525611019 is a deficient number, since it is larger than the sum of its proper divisors (1).
106525611019 is an equidigital number, since it uses as much as digits as its factorization.
106525611019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16200, while the sum is 37.
The spelling of 106525611019 in words is "one hundred six billion, five hundred twenty-five million, six hundred eleven thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •