Base | Representation |
---|---|
bin | 1100100000110… |
… | …11001000101101 |
3 | 21022111222001110 |
4 | 12100123020231 |
5 | 203332444444 |
6 | 14225502233 |
7 | 2413135224 |
oct | 620331055 |
9 | 238458043 |
10 | 104968749 |
11 | 54285636 |
12 | 2b1a1979 |
13 | 189932b2 |
14 | dd25cbb |
15 | 9336cb9 |
hex | 641b22d |
104968749 has 8 divisors (see below), whose sum is σ = 147324640. Its totient is φ = 66296016.
The previous prime is 104968723. The next prime is 104968763. The reversal of 104968749 is 947869401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 104968749 - 27 = 104968621 is a prime.
It is a super-2 number, since 2×1049687492 = 22036876533250002, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 104968698 and 104968707.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104968789) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 920722 + ... + 920835.
It is an arithmetic number, because the mean of its divisors is an integer number (18415580).
Almost surely, 2104968749 is an apocalyptic number.
104968749 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
104968749 is a deficient number, since it is larger than the sum of its proper divisors (42355891).
104968749 is a wasteful number, since it uses less digits than its factorization.
104968749 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1841579.
The product of its (nonzero) digits is 435456, while the sum is 48.
The square root of 104968749 is about 10245.4257598208. The cubic root of 104968749 is about 471.7225893702.
The spelling of 104968749 in words is "one hundred four million, nine hundred sixty-eight thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •