Search a number
-
+
50567010045 = 353371134003
BaseRepresentation
bin101111000110000001…
…110101011011111101
311211112002202021011220
4233012001311123331
51312030123310140
635121414303553
73440045331156
oct570601653375
9154462667156
1050567010045
111a4998390a2
129972957bb9
1349cb387726
142639b6a92d
1514ae547bd0
hexbc60756fd

50567010045 has 8 divisors (see below), whose sum is σ = 80907216096. Its totient is φ = 26969072016.

The previous prime is 50567009993. The next prime is 50567010071. The reversal of 50567010045 is 54001076505.

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

It is not a de Polignac number, because 50567010045 - 26 = 50567009981 is a prime.

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

It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.

It is a junction number, because it is equal to n+sod(n) for n = 50567009988 and 50567010015.

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 250567010045 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3371134011.

The product of its (nonzero) digits is 21000, while the sum is 33.

The spelling of 50567010045 in words is "fifty billion, five hundred sixty-seven million, ten thousand, forty-five".

Divisors: 1 3 5 15 3371134003 10113402009 16855670015 50567010045