Search a number
-
+
505125153404435 = 5101025030680887
BaseRepresentation
bin111001011011010001001110…
…1010101011111011000010011
32110020111111022102220110020002
41302312202131111133120103
51012201432303232420220
64550151143022040215
7211253042122206134
oct16266423525373023
92406444272813202
10505125153404435
11136a48413569483
12487a077ba1906b
13188b11364c2545
148ca428b73dc8b
153d5e6e772ec75
hex1cb689d55f613

505125153404435 has 4 divisors (see below), whose sum is σ = 606150184085328. Its totient is φ = 404100122723544.

The previous prime is 505125153404413. The next prime is 505125153404437. The reversal of 505125153404435 is 534404351521505.

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 505125153404435 - 26 = 505125153404371 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 505125153404435.

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

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

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

Almost surely, 2505125153404435 is an apocalyptic number.

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

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

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

The sum of its prime factors is 101025030680892.

The product of its (nonzero) digits is 3600000, while the sum is 47.

The spelling of 505125153404435 in words is "five hundred five trillion, one hundred twenty-five billion, one hundred fifty-three million, four hundred four thousand, four hundred thirty-five".

Divisors: 1 5 101025030680887 505125153404435