Search a number
-
+
5005555050505 = 51001111010101
BaseRepresentation
bin100100011010111001001…
…0101001010100000001001
3122201112012201220221010111
41020311302111022200021
51124002334043104010
614351304212314321
71024432214624512
oct110656225124011
918645181827114
105005555050505
11165a931371199
1268a13a3129a1
132a4038c110b9
141343ad44da09
158a31526758a
hex48d7254a809

5005555050505 has 4 divisors (see below), whose sum is σ = 6006666060612. Its totient is φ = 4004444040400.

The previous prime is 5005555050413. The next prime is 5005555050521. The reversal of 5005555050505 is 5050505555005.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 3658302703561 + 1347252346944 = 1912669^2 + 1160712^2 .

It is not a de Polignac number, because 5005555050505 - 221 = 5005552953353 is a prime.

It is a super-2 number, since 2×50055550505052 (a number of 26 digits) contains 22 as substring.

It is a Duffinian number.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 500555505046 + ... + 500555505055.

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

Almost surely, 25005555050505 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1001111010106.

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

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

Divisors: 1 5 1001111010101 5005555050505