Search a number
-
+
505212641153 = 11298319081189
BaseRepresentation
bin1110101101000010000…
…01010001111110000001
31210022001010201022121222
413112201001101332001
531234133414004103
61024031432124425
751333432411023
oct7264101217601
91708033638558
10505212641153
111852944019a0
1281ab6836715
133884506b71c
141a649638013
15d21d58e638
hex75a1051f81

505212641153 has 16 divisors (see below), whose sum is σ = 577015185600. Its totient is φ = 438104076480.

The previous prime is 505212641147. The next prime is 505212641173. The reversal of 505212641153 is 351146212505.

It is not a de Polignac number, because 505212641153 - 214 = 505212624769 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 2505212641153 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 19081312.

The product of its (nonzero) digits is 36000, while the sum is 35.

Adding to 505212641153 its reverse (351146212505), we get a palindrome (856358853658).

The spelling of 505212641153 in words is "five hundred five billion, two hundred twelve million, six hundred forty-one thousand, one hundred fifty-three".

Divisors: 1 11 29 83 319 913 2407 26477 19081189 209893079 553354481 1583738687 6086899291 17421125557 45928421923 505212641153