Search a number
-
+
51010010001 = 3213457421177
BaseRepresentation
bin101111100000011011…
…101111101110010001
311212122222022222212200
4233200123233232101
51313432030310001
635233401313413
73454034634216
oct574033575621
9155588288780
1051010010001
111a6a6903565
129a77195869
134a6c0a3192
14267c925b0d
1514d83a2086
hexbe06efb91

51010010001 has 12 divisors (see below), whose sum is σ = 73686775812. Its totient is φ = 34004065536.

The previous prime is 51010009997. The next prime is 51010010021. The reversal of 51010010001 is 10001001015.

It can be written as a sum of positive squares in 2 ways, for example, as 39820601601 + 11189408400 = 199551^2 + 105780^2 .

It is not a de Polignac number, because 51010010001 - 22 = 51010009997 is a prime.

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

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

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

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

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

Almost surely, 251010010001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 5, while the sum is 9.

Adding to 51010010001 its reverse (10001001015), we get a palindrome (61011011016).

The spelling of 51010010001 in words is "fifty-one billion, ten million, ten thousand, one".

Divisors: 1 3 9 13457 40371 121113 421177 1263531 3790593 5667778889 17003336667 51010010001