Base | Representation |
---|---|
bin | 1100101110110… |
… | …10000001111011 |
3 | 21102221221222221 |
4 | 12113122001323 |
5 | 204320033402 |
6 | 14333024511 |
7 | 2434531003 |
oct | 627320173 |
9 | 242857887 |
10 | 106799227 |
11 | 55315927 |
12 | 2b925137 |
13 | 19184512 |
14 | 10281003 |
15 | 9599337 |
hex | 65da07b |
106799227 has 4 divisors (see below), whose sum is σ = 108550096. Its totient is φ = 105048360.
The previous prime is 106799221. The next prime is 106799233. The reversal of 106799227 is 722997601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 722997601 = 12953 ⋅55817.
It is an interprime number because it is at equal distance from previous prime (106799221) and next prime (106799233).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106799227 is a prime.
It is a super-2 number, since 2×1067992272 = 22812149775595058, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106799221) 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, 875343 + ... + 875464.
It is an arithmetic number, because the mean of its divisors is an integer number (27137524).
Almost surely, 2106799227 is an apocalyptic number.
106799227 is a deficient number, since it is larger than the sum of its proper divisors (1750869).
106799227 is an equidigital number, since it uses as much as digits as its factorization.
106799227 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1750868.
The product of its (nonzero) digits is 95256, while the sum is 43.
The square root of 106799227 is about 10334.3711468091. The cubic root of 106799227 is about 474.4488188388.
The spelling of 106799227 in words is "one hundred six million, seven hundred ninety-nine thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •