Base | Representation |
---|---|
bin | 110001011011110001… |
… | …0101001011011000101 |
3 | 101011000100222222201122 |
4 | 1202313202221123011 |
5 | 3214403040400242 |
6 | 120434001403325 |
7 | 10445464413131 |
oct | 1426742513305 |
9 | 334010888648 |
10 | 106158528197 |
11 | 410267a3527 |
12 | 186a8339545 |
13 | a01a6a2077 |
14 | 51d0d383c1 |
15 | 2b64c38ad2 |
hex | 18b78a96c5 |
106158528197 has 2 divisors, whose sum is σ = 106158528198. Its totient is φ = 106158528196.
The previous prime is 106158528191. The next prime is 106158528239. The reversal of 106158528197 is 791825851601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 91430035876 + 14728492321 = 302374^2 + 121361^2 .
It is an emirp because it is prime and its reverse (791825851601) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106158528197 is a prime.
It is a super-2 number, since 2×1061585281972 (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 (106158528191) 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, 53079264098 + 53079264099.
It is an arithmetic number, because the mean of its divisors is an integer number (53079264099).
Almost surely, 2106158528197 is an apocalyptic number.
It is an amenable number.
106158528197 is a deficient number, since it is larger than the sum of its proper divisors (1).
106158528197 is an equidigital number, since it uses as much as digits as its factorization.
106158528197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1209600, while the sum is 53.
The spelling of 106158528197 in words is "one hundred six billion, one hundred fifty-eight million, five hundred twenty-eight thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •