Base | Representation |
---|---|
bin | 1100101100001… |
… | …10101001001101 |
3 | 21102022121110221 |
4 | 12112012221031 |
5 | 204223121202 |
6 | 14321431341 |
7 | 2431606144 |
oct | 626065115 |
9 | 242277427 |
10 | 106457677 |
11 | 55102257 |
12 | 2b79b551 |
13 | 19094c11 |
14 | 101d275b |
15 | 952d037 |
hex | 6586a4d |
106457677 has 2 divisors, whose sum is σ = 106457678. Its totient is φ = 106457676.
The previous prime is 106457671. The next prime is 106457683. The reversal of 106457677 is 776754601.
It is a balanced prime because it is at equal distance from previous prime (106457671) and next prime (106457683).
It can be written as a sum of positive squares in only one way, i.e., 102697956 + 3759721 = 10134^2 + 1939^2 .
It is a cyclic number.
It is not a de Polignac number, because 106457677 - 219 = 105933389 is a prime.
It is a super-2 number, since 2×1064576772 = 22666473984472658, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106457671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53228838 + 53228839.
It is an arithmetic number, because the mean of its divisors is an integer number (53228839).
Almost surely, 2106457677 is an apocalyptic number.
It is an amenable number.
106457677 is a deficient number, since it is larger than the sum of its proper divisors (1).
106457677 is an equidigital number, since it uses as much as digits as its factorization.
106457677 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 246960, while the sum is 43.
The square root of 106457677 is about 10317.8329604622. The cubic root of 106457677 is about 473.9425072844.
The spelling of 106457677 in words is "one hundred six million, four hundred fifty-seven thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •