Search a number
-
+
10536150050 = 252210723001
BaseRepresentation
bin10011101000000000…
…01110010000100010
31000012021121212201122
421310000032100202
5133034223300200
64501254132242
7522044540426
oct116400162042
930167555648
1010536150050
114517422528
122060651082
13cbbabb91a
1471d448b86
15419eb7385
hex27400e422

10536150050 has 12 divisors (see below), whose sum is σ = 19597239186. Its totient is φ = 4214460000.

The previous prime is 10536149969. The next prime is 10536150059. The reversal of 10536150050 is 5005163501.

It can be written as a sum of positive squares in 3 ways, for example, as 9586955569 + 949194481 = 97913^2 + 30809^2 .

It is a super-2 number, since 2×105361500502 (a number of 21 digits) contains 22 as substring.

It is a Curzon number.

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

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 105361451 + ... + 105361550.

Almost surely, 210536150050 is an apocalyptic number.

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

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

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

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

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

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

The spelling of 10536150050 in words is "ten billion, five hundred thirty-six million, one hundred fifty thousand, fifty".

Divisors: 1 2 5 10 25 50 210723001 421446002 1053615005 2107230010 5268075025 10536150050