Search a number
-
+
536250050 = 25271532143
BaseRepresentation
bin11111111101101…
…000011011000010
31101101001022202222
4133331220123002
52044240000200
6125113411042
716201023140
oct3775503302
91341038688
10536250050
11255776666
1212b709a82
1387137b2b
1451310590
1532128d85
hex1ff686c2

536250050 has 24 divisors (see below), whose sum is σ = 1139915136. Its totient is φ = 183857040.

The previous prime is 536250041. The next prime is 536250061. The reversal of 536250050 is 50052635.

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

It is a Curzon number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 765722 + ... + 766421.

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

Almost surely, 2536250050 is an apocalyptic number.

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

536250050 is an abundant number, since it is smaller than the sum of its proper divisors (603665086).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 4500, while the sum is 26.

The square root of 536250050 is about 23157.0734334026. The cubic root of 536250050 is about 812.4359176284.

The spelling of 536250050 in words is "five hundred thirty-six million, two hundred fifty thousand, fifty".

Divisors: 1 2 5 7 10 14 25 35 50 70 175 350 1532143 3064286 7660715 10725001 15321430 21450002 38303575 53625005 76607150 107250010 268125025 536250050