Base | Representation |
---|---|
bin | 1100100100111… |
… | …01000100100101 |
3 | 21100112000010011 |
4 | 12102131010211 |
5 | 204002012330 |
6 | 14245130221 |
7 | 2420512663 |
oct | 622350445 |
9 | 240460104 |
10 | 105500965 |
11 | 54609489 |
12 | 2b3b9971 |
13 | 18b1b60b |
14 | 10023c33 |
15 | 93de82a |
hex | 649d125 |
105500965 has 4 divisors (see below), whose sum is σ = 126601164. Its totient is φ = 84400768.
The previous prime is 105500957. The next prime is 105500999. The reversal of 105500965 is 569005501.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 569005501 = 509 ⋅1117889.
It can be written as a sum of positive squares in 2 ways, for example, as 14546596 + 90954369 = 3814^2 + 9537^2 .
It is a cyclic number.
It is not a de Polignac number, because 105500965 - 23 = 105500957 is a prime.
It is a super-3 number, since 3×1055009653 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10550092 + ... + 10550101.
It is an arithmetic number, because the mean of its divisors is an integer number (31650291).
Almost surely, 2105500965 is an apocalyptic number.
It is an amenable number.
105500965 is a deficient number, since it is larger than the sum of its proper divisors (21100199).
105500965 is an equidigital number, since it uses as much as digits as its factorization.
105500965 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21100198.
The product of its (nonzero) digits is 6750, while the sum is 31.
The square root of 105500965 is about 10271.3662674447. The cubic root of 105500965 is about 472.5184935326.
The spelling of 105500965 in words is "one hundred five million, five hundred thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •