Base | Representation |
---|---|
bin | 1100101110101… |
… | …01111111111001 |
3 | 21102221010100022 |
4 | 12113111333321 |
5 | 204314021323 |
6 | 14332420225 |
7 | 2434431602 |
oct | 627257771 |
9 | 242833308 |
10 | 106782713 |
11 | 55304484 |
12 | 2b917675 |
13 | 19179b4b |
14 | 10278da9 |
15 | 95944c8 |
hex | 65d5ff9 |
106782713 has 2 divisors, whose sum is σ = 106782714. Its totient is φ = 106782712.
The previous prime is 106782677. The next prime is 106782733. The reversal of 106782713 is 317287601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101344489 + 5438224 = 10067^2 + 2332^2 .
It is a cyclic number.
It is not a de Polignac number, because 106782713 - 26 = 106782649 is a prime.
It is a super-2 number, since 2×1067827132 = 22805095591280738, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (106782733) 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, 53391356 + 53391357.
It is an arithmetic number, because the mean of its divisors is an integer number (53391357).
Almost surely, 2106782713 is an apocalyptic number.
It is an amenable number.
106782713 is a deficient number, since it is larger than the sum of its proper divisors (1).
106782713 is an equidigital number, since it uses as much as digits as its factorization.
106782713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14112, while the sum is 35.
The square root of 106782713 is about 10333.5721316493. The cubic root of 106782713 is about 474.4243634443.
The spelling of 106782713 in words is "one hundred six million, seven hundred eighty-two thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •