51050156990451 has 32 divisors (see below), whose sum is σ = 72115646803200. Its totient is φ = 32011549701120.

The previous prime is 51050156990429. The next prime is 51050156990489. The reversal of 51050156990451 is 15409965105015.

It is not a de Polignac number, because 51050156990451 - 2⁵ = 51050156990419 is a prime.

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

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

It is a junction number, because it is equal to n+sod(n) for n = 51050156990394 and 51050156990403.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 569336460 + ... + 569426118.

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

Almost surely, 2^{51050156990451} is an apocalyptic number.

51050156990451 is a gapful number since it is divisible by the number (51) formed by its first and last digit.

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

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

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

The sum of its prime factors is 96499.

The product of its (nonzero) digits is 1215000, while the sum is 51.

The spelling of 51050156990451 in words is "fifty-one trillion, fifty billion, one hundred fifty-six million, nine hundred ninety thousand, four hundred fifty-one".