Search a number
-
+
51000214152 = 23320123105601
BaseRepresentation
bin101111011111110110…
…011000001010001000
311212122021220022111110
4233133312120022020
51313422023323102
635232411330320
73453555444666
oct573766301210
9155567808443
1051000214152
111a6a1322818
129a73a509a0
134a6a053514
14267b4d5c36
1514d75b986c
hexbdfd98288

51000214152 has 32 divisors (see below), whose sum is σ = 127508078880. Its totient is φ = 16999065600.

The previous prime is 51000214129. The next prime is 51000214163. The reversal of 51000214152 is 25141200015.

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

It is an unprimeable number.

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

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

Almost surely, 251000214152 is an apocalyptic number.

It is an amenable number.

51000214152 is an abundant number, since it is smaller than the sum of its proper divisors (76507864728).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 400, while the sum is 21.

Adding to 51000214152 its reverse (25141200015), we get a palindrome (76141414167).

The spelling of 51000214152 in words is "fifty-one billion, two hundred fourteen thousand, one hundred fifty-two".

Divisors: 1 2 3 4 6 8 12 24 20123 40246 60369 80492 105601 120738 160984 211202 241476 316803 422404 482952 633606 844808 1267212 2534424 2125008923 4250017846 6375026769 8500035692 12750053538 17000071384 25500107076 51000214152