Search a number
-
+
1056050165 = 51494912887
BaseRepresentation
bin111110111100100…
…000101111110101
32201121010220111002
4332330200233311
54130322101130
6252442453045
735112164312
oct7674405765
92647126432
101056050165
114a2127135
12255804185
1313aa33371
14a037bd09
1562aa3b45
hex3ef20bf5

1056050165 has 16 divisors (see below), whose sum is σ = 1278806400. Its totient is φ = 837170880.

The previous prime is 1056050159. The next prime is 1056050179. The reversal of 1056050165 is 5610506501.

It is not a de Polignac number, because 1056050165 - 26 = 1056050101 is a prime.

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

It is a congruent 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, 364352 + ... + 367238.

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

Almost surely, 21056050165 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3532.

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

The square root of 1056050165 is about 32496.9254699579. The cubic root of 1056050165 is about 1018.3447988211.

Adding to 1056050165 its reverse (5610506501), we get a palindrome (6666556666).

The spelling of 1056050165 in words is "one billion, fifty-six million, fifty thousand, one hundred sixty-five".

Divisors: 1 5 149 491 745 2455 2887 14435 73159 365795 430163 1417517 2150815 7087585 211210033 1056050165