Search a number
-
+
110110003002 = 23219930739811
BaseRepresentation
bin110011010001100010…
…0010100111100111010
3101112012202101201010100
41212203010110330322
53301001130044002
6122330035300230
710645425403626
oct1464304247472
9345182351110
10110110003002
1142774253a8a
121940b74a676
13a4ca23373c
145487a5a186
152ce6ac611c
hex19a3114f3a

110110003002 has 24 divisors (see below), whose sum is σ = 239770533600. Its totient is φ = 36518894280.

The previous prime is 110110003001. The next prime is 110110003007. The reversal of 110110003002 is 200300011011.

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

It is a Harshad number since it is a multiple of its sum of digits (9).

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15366324 + ... + 15373487.

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

Almost surely, 2110110003002 is an apocalyptic number.

110110003002 is an abundant number, since it is smaller than the sum of its proper divisors (129660530598).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

110110003002 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 30740018 (or 30740015 counting only the distinct ones).

The product of its (nonzero) digits is 6, while the sum is 9.

Adding to 110110003002 its reverse (200300011011), we get a palindrome (310410014013).

The spelling of 110110003002 in words is "one hundred ten billion, one hundred ten million, three thousand, two".

Divisors: 1 2 3 6 9 18 199 398 597 1194 1791 3582 30739811 61479622 92219433 184438866 276658299 553316598 6117222389 12234444778 18351667167 36703334334 55055001501 110110003002