Search a number
-
+
1064200051 = 17195955843
BaseRepresentation
bin111111011011100…
…110011101110011
32202011110222000201
4333123212131303
54134413400201
6253333300031
735241360025
oct7733463563
92664428021
101064200051
114a6793282
12258494617
1313c627a95
14a14a0015
1563663801
hex3f6e6773

1064200051 has 16 divisors (see below), whose sum is σ = 1206230400. Its totient is φ = 932784768.

The previous prime is 1064200019. The next prime is 1064200063. The reversal of 1064200051 is 1500024601.

It is a cyclic number.

It is not a de Polignac number, because 1064200051 - 25 = 1064200019 is a prime.

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

It is a Harshad number since it is a multiple of its sum of digits (19).

It is a Duffinian number.

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

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

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

Almost surely, 21064200051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 55938.

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

The square root of 1064200051 is about 32622.0791949256. The cubic root of 1064200051 is about 1020.9577224755.

Adding to 1064200051 its reverse (1500024601), we get a palindrome (2564224652).

The spelling of 1064200051 in words is "one billion, sixty-four million, two hundred thousand, fifty-one".

Divisors: 1 17 19 59 323 1003 1121 19057 55843 949331 1061017 3294737 18037289 56010529 62600003 1064200051