Search a number
-
+
1050050485 = 511199111103
BaseRepresentation
bin111110100101100…
…111111110110101
32201011212002110201
4332211213332311
54122303103420
6252110120501
735010165451
oct7645477665
92634762421
101050050485
114997a9520
122537b0131
13139712563
149d659661
15622bb10a
hex3e967fb5

1050050485 has 32 divisors (see below), whose sum is σ = 1449861120. Its totient is φ = 722030400.

The previous prime is 1050050483. The next prime is 1050050501. The reversal of 1050050485 is 5840500501.

It is not a de Polignac number, because 1050050485 - 21 = 1050050483 is a prime.

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

It is a congruent number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 951444 + ... + 952546.

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

Almost surely, 21050050485 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2049.

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

The square root of 1050050485 is about 32404.4824831380. The cubic root of 1050050485 is about 1016.4126463221.

Adding to 1050050485 its reverse (5840500501), we get a palindrome (6890550986).

The spelling of 1050050485 in words is "one billion, fifty million, fifty thousand, four hundred eighty-five".

Divisors: 1 5 11 19 55 95 209 911 1045 1103 4555 5515 10021 12133 17309 20957 50105 60665 86545 104785 190399 230527 951995 1004833 1152635 5024165 11053163 19091827 55265815 95459135 210010097 1050050485