Base | Representation |
---|---|
bin | 1100101111011… |
… | …10101000111001 |
3 | 21110010020210101 |
4 | 12113232220321 |
5 | 204330234031 |
6 | 14334515401 |
7 | 2435332054 |
oct | 627565071 |
9 | 243106711 |
10 | 106883641 |
11 | 55373297 |
12 | 2b965b61 |
13 | 191b3a77 |
14 | 102a3a9b |
15 | 95b4361 |
hex | 65eea39 |
106883641 has 4 divisors (see below), whose sum is σ = 113170932. Its totient is φ = 100596352.
The previous prime is 106883627. The next prime is 106883663. The reversal of 106883641 is 146388601.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 88906041 + 17977600 = 9429^2 + 4240^2 .
It is a cyclic number.
It is not a de Polignac number, because 106883641 - 213 = 106875449 is a prime.
It is a super-2 number, since 2×1068836412 = 22848225426833762, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 106883641.
It is not an unprimeable number, because it can be changed into a prime (106883611) 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, 3143620 + ... + 3143653.
It is an arithmetic number, because the mean of its divisors is an integer number (28292733).
Almost surely, 2106883641 is an apocalyptic number.
It is an amenable number.
106883641 is a deficient number, since it is larger than the sum of its proper divisors (6287291).
106883641 is an equidigital number, since it uses as much as digits as its factorization.
106883641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6287290.
The product of its (nonzero) digits is 27648, while the sum is 37.
The square root of 106883641 is about 10338.4544783057. The cubic root of 106883641 is about 474.5737872070.
The spelling of 106883641 in words is "one hundred six million, eight hundred eighty-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •