Search a number
-
+
504642517022011 = 2385925542466823
BaseRepresentation
bin111001010111110000011110…
…1111101110011010100111011
32110011210100112200101220102211
41302233200331331303110323
51012121030333324201021
64545141323305235551
7211203135003512314
oct16257407575632473
92404710480356384
10504642517022011
11136881764945955
1248723125a92bb7
131887777b7ab3c4
148c88b8460d60b
153d51d9b19c3e1
hex1caf83df7353b

504642517022011 has 8 divisors (see below), whose sum is σ = 527196515247360. Its totient is φ = 482139603732072.

The previous prime is 504642517021999. The next prime is 504642517022071. The reversal of 504642517022011 is 110220715246405.

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 504642517022011 - 219 = 504642516497723 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 2504642517022011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 25542467705.

The product of its (nonzero) digits is 134400, while the sum is 40.

The spelling of 504642517022011 in words is "five hundred four trillion, six hundred forty-two billion, five hundred seventeen million, twenty-two thousand, eleven".

Divisors: 1 23 859 19757 25542466823 587476736929 21940979000957 504642517022011