Search a number
-
+
51050010556057 = 257919794498083
BaseRepresentation
bin10111001101110000000011…
…01111101011011010011001
320200202100000000021011102211
423212320001233223122121
523142400410200243212
6300324015011355121
713516145565036442
oct1346700157533231
9220670000234384
1051050010556057
11152a22080a6a47
125885a012b2aa1
132263cc29b6206
14c86b9592c2c9
155d7ddbb539a7
hex2e6e01beb699

51050010556057 has 4 divisors (see below), whose sum is σ = 51069805056720. Its totient is φ = 51030216055396.

The previous prime is 51050010556009. The next prime is 51050010556079. The reversal of 51050010556057 is 75065501005015.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-51050010556057 is a prime.

It is a super-2 number, since 2×510500105560572 (a number of 28 digits) contains 22 as substring.

It is a Duffinian number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9897246463 + ... + 9897251620.

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

Almost surely, 251050010556057 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 19794500662.

The product of its (nonzero) digits is 131250, while the sum is 40.

The spelling of 51050010556057 in words is "fifty-one trillion, fifty billion, ten million, five hundred fifty-six thousand, fifty-seven".

Divisors: 1 2579 19794498083 51050010556057