Base | Representation |
---|---|
bin | 110001100001110110… |
… | …1100000101011011101 |
3 | 101011112121012010021222 |
4 | 1203003231200223131 |
5 | 3220312322440212 |
6 | 120510133503125 |
7 | 10453524024506 |
oct | 1430355405335 |
9 | 334477163258 |
10 | 106362702557 |
11 | 41120a77771 |
12 | 187447a1aa5 |
13 | a050a8b3b7 |
14 | 52100c5bad |
15 | 2b77b19c72 |
hex | 18c3b60add |
106362702557 has 2 divisors, whose sum is σ = 106362702558. Its totient is φ = 106362702556.
The previous prime is 106362702553. The next prime is 106362702559. The reversal of 106362702557 is 755207263601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105693911236 + 668791321 = 325106^2 + 25861^2 .
It is a cyclic number.
It is not a de Polignac number, because 106362702557 - 22 = 106362702553 is a prime.
It is a super-2 number, since 2×1063627025572 (a number of 23 digits) contains 22 as substring.
Together with 106362702559, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106362702553) 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, 53181351278 + 53181351279.
It is an arithmetic number, because the mean of its divisors is an integer number (53181351279).
Almost surely, 2106362702557 is an apocalyptic number.
It is an amenable number.
106362702557 is a deficient number, since it is larger than the sum of its proper divisors (1).
106362702557 is an equidigital number, since it uses as much as digits as its factorization.
106362702557 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 529200, while the sum is 44.
The spelling of 106362702557 in words is "one hundred six billion, three hundred sixty-two million, seven hundred two thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •