Search a number
-
+
1000101991 = 7280350971
BaseRepresentation
bin111011100111000…
…101100001100111
32120200212110000111
4323213011201213
54022011230431
6243123353451
733532504150
oct7347054147
92520773014
101000101991
11473593479
1223ab22887
1312c274735
1496b76927
155cc017b1
hex3b9c5867

1000101991 has 8 divisors (see below), whose sum is σ = 1143403904. Its totient is φ = 856907640.

The previous prime is 1000101967. The next prime is 1000102003. The reversal of 1000101991 is 1991010001.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 1000101991 - 211 = 1000099943 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

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

Almost surely, 21000101991 is an apocalyptic number.

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

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

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

The sum of its prime factors is 53781.

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

The square root of 1000101991 is about 31624.3891798719. The cubic root of 1000101991 is about 1000.0339958443.

Adding to 1000101991 its reverse (1991010001), we get a palindrome (2991111992).

The spelling of 1000101991 in words is "one billion, one hundred one thousand, nine hundred ninety-one".

Divisors: 1 7 2803 19621 50971 356797 142871713 1000101991