Base | Representation |
---|---|
bin | 1100101100011… |
… | …11011001111001 |
3 | 21102101102200222 |
4 | 12112033121321 |
5 | 204230243221 |
6 | 14322305425 |
7 | 2432115566 |
oct | 626173171 |
9 | 242342628 |
10 | 106493561 |
11 | 55127209 |
12 | 2b7b8275 |
13 | 190a8355 |
14 | 1020186d |
15 | 95389ab |
hex | 658f679 |
106493561 has 4 divisors (see below), whose sum is σ = 106529124. Its totient is φ = 106458000.
The previous prime is 106493551. The next prime is 106493609. The reversal of 106493561 is 165394601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 165394601 = 19 ⋅8704979.
It can be written as a sum of positive squares in 2 ways, for example, as 15405625 + 91087936 = 3925^2 + 9544^2 .
It is a cyclic number.
It is not a de Polignac number, because 106493561 - 218 = 106231417 is a prime.
It is a super-2 number, since 2×1064935612 = 22681757068921442, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (106493521) 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, 12830 + ... + 19431.
It is an arithmetic number, because the mean of its divisors is an integer number (26632281).
Almost surely, 2106493561 is an apocalyptic number.
It is an amenable number.
106493561 is a deficient number, since it is larger than the sum of its proper divisors (35563).
106493561 is an equidigital number, since it uses as much as digits as its factorization.
106493561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35562.
The product of its (nonzero) digits is 19440, while the sum is 35.
The square root of 106493561 is about 10319.5717449902. The cubic root of 106493561 is about 473.9957523639.
The spelling of 106493561 in words is "one hundred six million, four hundred ninety-three thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •