Search a number
-
+
1000515055 = 5200103011
BaseRepresentation
bin111011101000101…
…010010111101111
32120201122102122011
4323220222113233
54022112440210
6243140302051
733536144341
oct7350522757
92521572564
101000515055
11473845851
1223b0a1927
1312c38a757
1496c43291
155cc83d8a
hex3ba2a5ef

1000515055 has 4 divisors (see below), whose sum is σ = 1200618072. Its totient is φ = 800412040.

The previous prime is 1000514981. The next prime is 1000515067. The reversal of 1000515055 is 5505150001.

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

It is not a de Polignac number, because 1000515055 - 217 = 1000383983 is a prime.

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 100051501 + ... + 100051510.

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

Almost surely, 21000515055 is an apocalyptic number.

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

1000515055 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 200103016.

The product of its (nonzero) digits is 625, while the sum is 22.

The square root of 1000515055 is about 31630.9192879372. The cubic root of 1000515055 is about 1000.1716555327.

Adding to 1000515055 its reverse (5505150001), we get a palindrome (6505665056).

The spelling of 1000515055 in words is "one billion, five hundred fifteen thousand, fifty-five".

Divisors: 1 5 200103011 1000515055