Search a number
-
+
110103030330 = 2353670101011
BaseRepresentation
bin110011010001010100…
…1101110101000111010
3101112012021021110102020
41212202221232220322
53300442333432310
6122325230015310
710645312213266
oct1464251565072
9345167243366
10110103030330
1142770321347
1219409347536
13a4c8961ab7
145486b630a6
152ce619a170
hex19a2a6ea3a

110103030330 has 16 divisors (see below), whose sum is σ = 264247272864. Its totient is φ = 29360808080.

The previous prime is 110103030329. The next prime is 110103030341. The reversal of 110103030330 is 33030301011.

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

It is an unprimeable number.

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, 1835050476 + ... + 1835050535.

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

Almost surely, 2110103030330 is an apocalyptic number.

110103030330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

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

The sum of its prime factors is 3670101021.

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

Adding to 110103030330 its reverse (33030301011), we get a palindrome (143133331341).

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

Divisors: 1 2 3 5 6 10 15 30 3670101011 7340202022 11010303033 18350505055 22020606066 36701010110 55051515165 110103030330