Base | Representation |
---|---|
bin | 1100100000110… |
… | …10011011110011 |
3 | 21022111211010000 |
4 | 12100122123303 |
5 | 203332402000 |
6 | 14225441043 |
7 | 2413123650 |
oct | 620323363 |
9 | 238454100 |
10 | 104965875 |
11 | 54283463 |
12 | 2b1a0183 |
13 | 18991bb1 |
14 | dd24c27 |
15 | 9336000 |
hex | 641a6f3 |
104965875 has 80 divisors (see below), whose sum is σ = 223793856. Its totient is φ = 47952000.
The previous prime is 104965853. The next prime is 104965879. The reversal of 104965875 is 578569401.
It is not a de Polignac number, because 104965875 - 211 = 104963827 is a prime.
It is a super-2 number, since 2×1049658752 = 22035669829031250, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 104965875.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104965879) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 70135 + ... + 71615.
Almost surely, 2104965875 is an apocalyptic number.
104965875 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
104965875 is an abundant number, since it is smaller than the sum of its proper divisors (118827981).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104965875 is an equidigital number, since it uses as much as digits as its factorization.
104965875 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1515 (or 1496 counting only the distinct ones).
The product of its (nonzero) digits is 302400, while the sum is 45.
The square root of 104965875 is about 10245.2855011464. The cubic root of 104965875 is about 471.7182841425.
The spelling of 104965875 in words is "one hundred four million, nine hundred sixty-five thousand, eight hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •