Search a number
-
+
110033011131 = 336677670377
BaseRepresentation
bin110011001111001111…
…0101000000110111011
3101112000101112010010120
41212132132220012323
53300321422324011
6122314245144323
710643502106551
oct1463636500673
9345011463116
10110033011131
114273484793a
12193a99bb0a3
13a4b72b7614
14547b737bd1
152cdee68a06
hex199e7a81bb

110033011131 has 4 divisors (see below), whose sum is σ = 146710681512. Its totient is φ = 73355340752.

The previous prime is 110033011117. The next prime is 110033011133. The reversal of 110033011131 is 131110330011.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 110033011131 - 217 = 110032880059 is a prime.

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

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18338835186 + ... + 18338835191.

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

Almost surely, 2110033011131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 36677670380.

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

Adding to 110033011131 its reverse (131110330011), we get a palindrome (241143341142).

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

Divisors: 1 3 36677670377 110033011131