Search a number
-
+
51060510001 = 61837057541
BaseRepresentation
bin101111100011011100…
…011000110100110001
311212210111100122212001
4233203130120310301
51314032442310001
635242403534001
73455220113434
oct574334306461
9155714318761
1051060510001
111a7223659a6
129a9008a301
134a796a5037
14268550d81b
1514dca2a001
hexbe3718d31

51060510001 has 4 divisors (see below), whose sum is σ = 51897567604. Its totient is φ = 50223452400.

The previous prime is 51060509999. The next prime is 51060510029. The reversal of 51060510001 is 10001506015.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 19775390625 + 31285119376 = 140625^2 + 176876^2 .

It is a cyclic number.

It is not a de Polignac number, because 51060510001 - 21 = 51060509999 is a prime.

It is a super-3 number, since 3×510605100013 (a number of 33 digits) contains 333 as substring.

It is a Duffinian number.

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

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 3 ways as a sum of consecutive naturals, for example, 418528710 + ... + 418528831.

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

Almost surely, 251060510001 is an apocalyptic number.

It is an amenable number.

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

51060510001 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 837057602.

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

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

Divisors: 1 61 837057541 51060510001