Search a number
-
+
104761450 = 2522095229
BaseRepresentation
bin1100011111010…
…00100001101010
321022010102200201
412033220201222
5203304331300
614221222414
72411312653
oct617504152
9238112621
10104761450
1154153912
122b101a0a
131891cb31
14dcb052a
1592e566a
hex63e886a

104761450 has 12 divisors (see below), whose sum is σ = 194856390. Its totient is φ = 41904560.

The previous prime is 104761409. The next prime is 104761451. The reversal of 104761450 is 54167401.

It can be written as a sum of positive squares in 3 ways, for example, as 58262689 + 46498761 = 7633^2 + 6819^2 .

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

It is not an unprimeable number, because it can be changed into a prime (104761451) 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 5 ways as a sum of consecutive naturals, for example, 1047565 + ... + 1047664.

Almost surely, 2104761450 is an apocalyptic number.

104761450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 2095241 (or 2095236 counting only the distinct ones).

The product of its (nonzero) digits is 3360, while the sum is 28.

The square root of 104761450 is about 10235.3040990485. The cubic root of 104761450 is about 471.4118554132.

The spelling of 104761450 in words is "one hundred four million, seven hundred sixty-one thousand, four hundred fifty".

Divisors: 1 2 5 10 25 50 2095229 4190458 10476145 20952290 52380725 104761450