Search a number
-
+
505050050035 = 5101010010007
BaseRepresentation
bin1110101100101110101…
…01000010110111110011
31210021121210202211112201
413112113111002313303
531233320303100120
61024003343204031
751326416410316
oct7262725026763
91707553684481
10505050050035
1118521064a873
1281a702a6617
133881a48176b
141a631bd297d
15d20e17440a
hex7597542df3

505050050035 has 4 divisors (see below), whose sum is σ = 606060060048. Its totient is φ = 404040040024.

The previous prime is 505050050033. The next prime is 505050050051. The reversal of 505050050035 is 530050050505.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 505050050035 - 21 = 505050050033 is a prime.

It is a Duffinian number.

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

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

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

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

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

Almost surely, 2505050050035 is an apocalyptic number.

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

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

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

The sum of its prime factors is 101010010012.

The product of its (nonzero) digits is 9375, while the sum is 28.

The spelling of 505050050035 in words is "five hundred five billion, fifty million, fifty thousand, thirty-five".

Divisors: 1 5 101010010007 505050050035