Base | Representation |
---|---|
bin | 1100101001100… |
… | …10100011101001 |
3 | 21101200010000122 |
4 | 12110302203221 |
5 | 204131111012 |
6 | 14310213025 |
7 | 2425643045 |
oct | 624624351 |
9 | 241603018 |
10 | 106113257 |
11 | 54997508 |
12 | 2b654175 |
13 | 18ca4213 |
14 | 10143025 |
15 | 94b0e72 |
hex | 65328e9 |
106113257 has 2 divisors, whose sum is σ = 106113258. Its totient is φ = 106113256.
The previous prime is 106113229. The next prime is 106113277. The reversal of 106113257 is 752311601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103713856 + 2399401 = 10184^2 + 1549^2 .
It is an emirp because it is prime and its reverse (752311601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 106113257 - 224 = 89336041 is a prime.
It is a super-2 number, since 2×1061132572 = 22520046622296098, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (106113277) 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, 53056628 + 53056629.
It is an arithmetic number, because the mean of its divisors is an integer number (53056629).
Almost surely, 2106113257 is an apocalyptic number.
It is an amenable number.
106113257 is a deficient number, since it is larger than the sum of its proper divisors (1).
106113257 is an equidigital number, since it uses as much as digits as its factorization.
106113257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 26.
The square root of 106113257 is about 10301.1289187157. The cubic root of 106113257 is about 473.4308434410.
Adding to 106113257 its reverse (752311601), we get a palindrome (858424858).
The spelling of 106113257 in words is "one hundred six million, one hundred thirteen thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •