Search a number
-
+
1000501001005 = 5111011741103451
BaseRepresentation
bin11101000111100101000…
…00011011101100101101
310112122110122010220122211
432203302200123230231
5112343011224013010
62043342424410421
7132166230122242
oct16436240335455
93478418126584
101000501001005
11356345806410
12141aa1916a11
137346801143c
14365d2bbd5c9
151b05a72b08a
hexe8f281bb2d

1000501001005 has 32 divisors (see below), whose sum is σ = 1323487092096. Its totient is φ = 720012000000.

The previous prime is 1000501000997. The next prime is 1000501001033. The reversal of 1000501001005 is 5001001050001.

It is not a de Polignac number, because 1000501001005 - 23 = 1000501000997 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9619530 + ... + 9722980.

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

Almost surely, 21000501001005 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 105309.

The product of its (nonzero) digits is 25, while the sum is 13.

Adding to 1000501001005 its reverse (5001001050001), we get a palindrome (6001502051006).

The spelling of 1000501001005 in words is "one trillion, five hundred one million, one thousand, five".

Divisors: 1 5 11 55 101 505 1111 1741 5555 8705 19151 95755 103451 175841 517255 879205 1137961 1934251 5689805 9671255 10448551 52242755 114934061 180108191 574670305 900540955 1981190101 9905950505 18190927291 90954636455 200100200201 1000501001005