Search a number
50676467605 = 541475259623
BaseRepresentation
bin101111001100100011…
…011000011110010101
311211210201201021201121
4233030203120132111
51312241133430410
635140324323541
73442544603341
oct571443303625
9154721637647
1050676467605
111a5455aa195
1299a35435b1
134a17c5cc0a
14264a500621
1514b8e699da
hexbcc8d8795

50676467605 has 16 divisors (see below), whose sum is σ = 63620411904. Its totient is φ = 38710817920.

The previous prime is 50676467599. The next prime is 50676467609.

50676467605 is nontrivially palindromic in base 10.

It is not a de Polignac number, because 50676467605 - 25 = 50676467573 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2620177 + ... + 2639446.

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

Almost surely, 250676467605 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5259716.

The product of its (nonzero) digits is 6350400, while the sum is 52.

The spelling of 50676467605 in words is "fifty billion, six hundred seventy-six million, four hundred sixty-seven thousand, six hundred five".