Search a number
-
+
505091410051 = 4392633436973
BaseRepresentation
bin1110101100110011100…
…10110100100010000011
31210021201200121010211011
413112121302310202003
531233411400110201
61024011421501351
751330431101414
oct7263162644203
91707650533734
10505091410051
11185231a2a1a8
1281a82111857
1338825c03347
141a6374bb80b
15d212ae4151
hex7599cb4883

505091410051 has 8 divisors (see below), whose sum is σ = 506435387040. Its totient is φ = 503748313152.

The previous prime is 505091410009. The next prime is 505091410097. The reversal of 505091410051 is 150014190505.

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 505091410051 - 29 = 505091409539 is a prime.

It is a super-4 number, since 4×5050914100514 (a number of 48 digits) contains 4444 as substring.

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

It is not an unprimeable number, because it can be changed into a prime (505091416051) 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 7 ways as a sum of consecutive naturals, for example, 937401 + ... + 1374373.

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

Almost surely, 2505091410051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 440045.

The product of its (nonzero) digits is 4500, while the sum is 31.

The spelling of 505091410051 in words is "five hundred five billion, ninety-one million, four hundred ten thousand, fifty-one".

Divisors: 1 439 2633 436973 1155887 191831147 1150549909 505091410051