Search a number
-
+
50050510010 = 255005051001
BaseRepresentation
bin101110100111001111…
…100010110010111010
311210012002212100022222
4232213033202302322
51310000412310020
634554244044042
73421204213154
oct564717426272
9153162770288
1050050510010
111a254231a66
129849993622
1349483762c7
1425cb31bad4
15147e020b25
hexba73e2cba

50050510010 has 8 divisors (see below), whose sum is σ = 90090918036. Its totient is φ = 20020204000.

The previous prime is 50050509989. The next prime is 50050510021. The reversal of 50050510010 is 1001505005.

It can be written as a sum of positive squares in 2 ways, for example, as 46303723489 + 3746786521 = 215183^2 + 61211^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

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

It is a Curzon number.

It is an unprimeable number.

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

Almost surely, 250050510010 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5005051008.

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

The spelling of 50050510010 in words is "fifty billion, fifty million, five hundred ten thousand, ten".

Divisors: 1 2 5 10 5005051001 10010102002 25025255005 50050510010