Base | Representation |
---|---|
bin | 1100101001110… |
… | …00100010101101 |
3 | 21101201100122122 |
4 | 12110320202231 |
5 | 204132402043 |
6 | 14310522325 |
7 | 2426104400 |
oct | 624704255 |
9 | 241640578 |
10 | 106137773 |
11 | 54a03975 |
12 | 2b6663a5 |
13 | 18cb2421 |
14 | 1014bd37 |
15 | 94b8368 |
hex | 65388ad |
106137773 has 6 divisors (see below), whose sum is σ = 123466446. Its totient is φ = 90975192.
The previous prime is 106137737. The next prime is 106137833. The reversal of 106137773 is 377731601.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 59938564 + 46199209 = 7742^2 + 6797^2 .
It is not a de Polignac number, because 106137773 - 210 = 106136749 is a prime.
It is a super-2 number, since 2×1061377732 = 22530453714799058, 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 (106137973) 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 in 5 ways as a sum of consecutive naturals, for example, 1082990 + ... + 1083087.
It is an arithmetic number, because the mean of its divisors is an integer number (20577741).
Almost surely, 2106137773 is an apocalyptic number.
It is an amenable number.
106137773 is a deficient number, since it is larger than the sum of its proper divisors (17328673).
106137773 is an equidigital number, since it uses as much as digits as its factorization.
106137773 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2166091 (or 2166084 counting only the distinct ones).
The product of its (nonzero) digits is 18522, while the sum is 35.
The square root of 106137773 is about 10302.3188166548. The cubic root of 106137773 is about 473.4673005157.
The spelling of 106137773 in words is "one hundred six million, one hundred thirty-seven thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •