Search a number
-
+
9901101011131 = 112307139014351
BaseRepresentation
bin1001000000010100011110…
…0110111101000010111011
31022001112110202100001220201
42100011013212331002323
52244204423324324011
633020300352303031
72041221340662631
oct220050746750273
938045422301821
109901101011131
113178040443980
12113aa96841a77
1356a892791a75
142633043d1351
1512283c6ddcc1
hex901479bd0bb

9901101011131 has 8 divisors (see below), whose sum is σ = 10801669552128. Its totient is φ = 9000610545000.

The previous prime is 9901101011093. The next prime is 9901101011141. The reversal of 9901101011131 is 1311101011099.

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 9901101011131 - 211 = 9901101009083 is a prime.

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

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 9901101011131.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19253395 + ... + 19760956.

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

Almost surely, 29901101011131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 39037433.

The product of its (nonzero) digits is 243, while the sum is 28.

The spelling of 9901101011131 in words is "nine trillion, nine hundred one billion, one hundred one million, eleven thousand, one hundred thirty-one".

Divisors: 1 11 23071 253781 39014351 429157861 900100091921 9901101011131