Search a number
-
+
500555505505 = 51197110319091
BaseRepresentation
bin1110100100010110110…
…11101101111101100001
31202212000120111022112111
413102023123231331201
531200114202134010
61021541345355321
751110142411046
oct7221333557541
91685016438474
10500555505505
11183314595a60
1281017038b41
1338282268163
141a326d071cd
15d0497b258a
hex748b6edf61

500555505505 has 32 divisors (see below), whose sum is σ = 656655952896. Its totient is φ = 363272760000.

The previous prime is 500555505451. The next prime is 500555505511. The reversal of 500555505505 is 505505555005.

It is not a de Polignac number, because 500555505505 - 29 = 500555504993 is a prime.

It is a Duffinian number.

It is an unprimeable number.

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 31 ways as a sum of consecutive naturals, for example, 55056010 + ... + 55065100.

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

Almost surely, 2500555505505 is an apocalyptic number.

500555505505 is a gapful number since it is divisible by the number (55) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 11109.

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

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

Divisors: 1 5 11 55 971 1031 4855 5155 9091 10681 11341 45455 53405 56705 100001 500005 1001101 5005505 8827361 9372821 11012111 44136805 46864105 55060555 97100971 103101031 485504855 515505155 9101009191 45505045955 100111101101 500555505505