Search a number
-
+
501550641361 = 7116513644693
BaseRepresentation
bin1110100110001101011…
…11110111000011010001
31202221120221000110022001
413103012233313003101
531204133431010421
61022224214514001
751143615052550
oct7230657670321
91687527013261
10501550641361
11183785297290
1281254365901
13383b0491343
141a3bd149d97
15d0a6d32691
hex74c6bf70d1

501550641361 has 8 divisors (see below), whose sum is σ = 625309890624. Its totient is φ = 390818681520.

The previous prime is 501550641359. The next prime is 501550641373. The reversal of 501550641361 is 163146055105.

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 501550641361 - 21 = 501550641359 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 501550641361.

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

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

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

Almost surely, 2501550641361 is an apocalyptic number.

It is an amenable number.

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

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

501550641361 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 6513644711.

The product of its (nonzero) digits is 54000, while the sum is 37.

Adding to 501550641361 its reverse (163146055105), we get a palindrome (664696696466).

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

Divisors: 1 7 11 77 6513644693 45595512851 71650091623 501550641361