Search a number
-
+
50000100051 = 3111515154547
BaseRepresentation
bin101110100100001111…
…001111101011010011
311210001121000020212110
4232210033033223103
51304400011200201
634545243400403
73420022560306
oct564417175323
9153047006773
1050000100051
111a228831240
129834b23103
13493aaa6425
1425c4758b3d
1514798b46d6
hexba43cfad3

50000100051 has 8 divisors (see below), whose sum is σ = 72727418304. Its totient is φ = 30303090920.

The previous prime is 50000100037. The next prime is 50000100067. The reversal of 50000100051 is 15000100005.

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

It is a cyclic number.

It is not a de Polignac number, because 50000100051 - 27 = 50000099923 is a prime.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 757577241 + ... + 757577306.

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

Almost surely, 250000100051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1515154561.

The product of its (nonzero) digits is 25, while the sum is 12.

Adding to 50000100051 its reverse (15000100005), we get a palindrome (65000200056).

It can be divided in two parts, 50000 and 100051, that added together give a palindrome (150051).

The spelling of 50000100051 in words is "fifty billion, one hundred thousand, fifty-one".

Divisors: 1 3 11 33 1515154547 4545463641 16666700017 50000100051