Search a number
-
+
51010055001 = 3213194297031
BaseRepresentation
bin101111100000011011…
…111010101101011001
311212122222102021121100
4233200123322231121
51313432033230001
635233402302013
73454035212343
oct574033725531
9155588367540
1051010055001
111a6a6934354
129a771b7909
134a6c0ba7c9
14267c938293
1514d83b0586
hexbe06fab59

51010055001 has 12 divisors (see below), whose sum is σ = 73737069120. Its totient is φ = 33980913240.

The previous prime is 51010054999. The next prime is 51010055053. The reversal of 51010055001 is 10055001015.

51010055001 is a `hidden beast` number, since 5 + 10 + 100 + 550 + 0 + 1 = 666.

It is not a de Polignac number, because 51010055001 - 21 = 51010054999 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (51010055101) 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, 2136645 + ... + 2160386.

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

Almost surely, 251010055001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 125, while the sum is 18.

Adding to 51010055001 its reverse (10055001015), we get a palindrome (61065056016).

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

Divisors: 1 3 9 1319 3957 11871 4297031 12891093 38673279 5667783889 17003351667 51010055001