Search a number
-
+
1050011065 = 52322214111
BaseRepresentation
bin111110100101011…
…110010110111001
32201011210002101201
4332211132112321
54122300323230
6252105214201
735006642515
oct7645362671
92634702351
101050011065
11499781944
12253791361
131396ca62c
149d649145
15622ae5ca
hex3e95e5b9

1050011065 has 16 divisors (see below), whose sum is σ = 1315708416. Its totient is φ = 802929600.

The previous prime is 1050011057. The next prime is 1050011093. The reversal of 1050011065 is 5601100501.

It is not a de Polignac number, because 1050011065 - 23 = 1050011057 is a prime.

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

It is a Duffinian number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 253360 + ... + 257470.

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

Almost surely, 21050011065 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6360.

The product of its (nonzero) digits is 150, while the sum is 19.

The square root of 1050011065 is about 32403.8742282462. The cubic root of 1050011065 is about 1016.3999270962.

Adding to 1050011065 its reverse (5601100501), we get a palindrome (6651111566).

The spelling of 1050011065 in words is "one billion, fifty million, eleven thousand, sixty-five".

Divisors: 1 5 23 115 2221 4111 11105 20555 51083 94553 255415 472765 9130531 45652655 210002213 1050011065