Search a number
-
+
101130110011 = 719760376767
BaseRepresentation
bin101111000101111010…
…0110000010000111011
3100200000221010212202001
41132023310300100323
53124103302010021
6114243013121431
710210045515610
oct1361364602073
9320027125661
10101130110011
1139986346517
1217724329277
1396c89a34a8
144c7519a507
15296d56c091
hex178bd3043b

101130110011 has 8 divisors (see below), whose sum is σ = 121660282880. Its totient is φ = 82120690728.

The previous prime is 101130109991. The next prime is 101130110023. The reversal of 101130110011 is 110011031101.

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 101130110011 - 231 = 98982626363 is a prime.

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 101130110011.

It is not an unprimeable number, because it can be changed into a prime (101130110041) 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 7 ways as a sum of consecutive naturals, for example, 380188251 + ... + 380188516.

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

Almost surely, 2101130110011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 760376793.

The product of its (nonzero) digits is 3, while the sum is 10.

Adding to 101130110011 its reverse (110011031101), we get a palindrome (211141141112).

The spelling of 101130110011 in words is "one hundred one billion, one hundred thirty million, one hundred ten thousand, eleven".

Divisors: 1 7 19 133 760376767 5322637369 14447158573 101130110011