Base | Representation |
---|---|
bin | 1100101010111… |
… | …01111001010101 |
3 | 21102000010112022 |
4 | 12111131321111 |
5 | 204202301043 |
6 | 14314102525 |
7 | 2430312431 |
oct | 625357125 |
9 | 242003468 |
10 | 106290773 |
11 | 54aa8916 |
12 | 2b71aa45 |
13 | 19036c64 |
14 | 1018b9c1 |
15 | 94e8868 |
hex | 655de55 |
106290773 has 4 divisors (see below), whose sum is σ = 106495308. Its totient is φ = 106086240.
The previous prime is 106290703. The next prime is 106290791. The reversal of 106290773 is 377092601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 377092601 = 19 ⋅19846979.
It can be written as a sum of positive squares in 2 ways, for example, as 61105489 + 45185284 = 7817^2 + 6722^2 .
It is a cyclic number.
It is not a de Polignac number, because 106290773 - 28 = 106290517 is a prime.
It is a super-2 number, since 2×1062907732 = 22595456849875058, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106290703) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 101486 + ... + 102527.
It is an arithmetic number, because the mean of its divisors is an integer number (26623827).
Almost surely, 2106290773 is an apocalyptic number.
It is an amenable number.
106290773 is a deficient number, since it is larger than the sum of its proper divisors (204535).
106290773 is an equidigital number, since it uses as much as digits as its factorization.
106290773 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 204534.
The product of its (nonzero) digits is 15876, while the sum is 35.
The square root of 106290773 is about 10309.7416553471. The cubic root of 106290773 is about 473.6946958924.
The spelling of 106290773 in words is "one hundred six million, two hundred ninety thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •