Search a number
-
+
51066600507 = 3213436466671
BaseRepresentation
bin101111100011110011…
…100111110000111011
311212210220211002110100
4233203303213300323
51314041022204012
635243142250443
73455322641136
oct574363476073
9155726732410
1051066600507
111a72584587a
129a92126a23
134a7aa282a0
14268625721d
1514dd32e8dc
hexbe3ce7c3b

51066600507 has 12 divisors (see below), whose sum is σ = 79436934304. Its totient is φ = 31425600240.

The previous prime is 51066600491. The next prime is 51066600521. The reversal of 51066600507 is 70500666015.

It is a happy number.

It is not a de Polignac number, because 51066600507 - 24 = 51066600491 is a prime.

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 218233219 + ... + 218233452.

Almost surely, 251066600507 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 37800, while the sum is 36.

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

Divisors: 1 3 9 13 39 117 436466671 1309400013 3928200039 5674066723 17022200169 51066600507