Search a number
-
+
1001100505101 = 31673694754083
BaseRepresentation
bin11101001000101100011…
…11010111000000001101
310112201000102012212200020
432210112033113000031
5112400223212130401
62043522122052353
7132220126614504
oct16442617270015
93481012185606
101001100505101
11356623155744
1214202a64a0b9
13735322953a8
143664c67783b
151b09319bd36
hexe9163d700d

1001100505101 has 16 divisors (see below), whose sum is σ = 1342854664704. Its totient is φ = 663373705904.

The previous prime is 1001100505079. The next prime is 1001100505103. The reversal of 1001100505101 is 1015050011001.

It is a cyclic number.

It is not a de Polignac number, because 1001100505101 - 27 = 1001100504973 is a prime.

It is a congruent number.

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

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 15 ways as a sum of consecutive naturals, for example, 18483406 + ... + 18537488.

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

Almost surely, 21001100505101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 91200.

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

Adding to 1001100505101 its reverse (1015050011001), we get a palindrome (2016150516102).

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

Divisors: 1 3 167 501 36947 54083 110841 162249 6170149 9031861 18510447 27095583 1998204601 5994613803 333700168367 1001100505101