Search a number
-
+
104950257 = 3131267049
BaseRepresentation
bin1100100000101…
…10100111110001
321022111000200120
412100112213301
5203331402012
614225240453
72413030266
oct620264761
9238430616
10104950257
1154272755
122b193129
1318987a59
14dd1d26d
15933158c
hex64169f1

104950257 has 8 divisors (see below), whose sum is σ = 141002400. Its totient is φ = 69432480.

The previous prime is 104950253. The next prime is 104950259. The reversal of 104950257 is 752059401.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 104950257 - 22 = 104950253 is a prime.

It is a super-2 number, since 2×1049502572 = 22029112888732098, which contains 22 as substring.

It is not an unprimeable number, because it can be changed into a prime (104950253) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 133132 + ... + 133917.

It is an arithmetic number, because the mean of its divisors is an integer number (17625300).

Almost surely, 2104950257 is an apocalyptic number.

It is an amenable number.

104950257 is a deficient number, since it is larger than the sum of its proper divisors (36052143).

104950257 is a wasteful number, since it uses less digits than its factorization.

104950257 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 267183.

The product of its (nonzero) digits is 12600, while the sum is 33.

The square root of 104950257 is about 10244.5232685567. The cubic root of 104950257 is about 471.6948871366.

The spelling of 104950257 in words is "one hundred four million, nine hundred fifty thousand, two hundred fifty-seven".

Divisors: 1 3 131 393 267049 801147 34983419 104950257