Search a number
-
+
110113002 = 2326117389
BaseRepresentation
bin1101001000000…
…11000011101010
321200012022122100
412210003003222
5211142104002
614532034230
72504642106
oct644030352
9250168570
10110113002
115717958a
1230a62976
1319a7492c
14108a4906
159a0111c
hex69030ea

110113002 has 12 divisors (see below), whose sum is σ = 238578210. Its totient is φ = 36704328.

The previous prime is 110113001. The next prime is 110113007. The reversal of 110113002 is 200311011.

It can be written as a sum of positive squares in only one way, i.e., 67223601 + 42889401 = 8199^2 + 6549^2 .

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 (110113001) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3058677 + ... + 3058712.

Almost surely, 2110113002 is an apocalyptic number.

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

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

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

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

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

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

The square root of 110113002 is about 10493.4742578423. The cubic root of 110113002 is about 479.3060022902.

Adding to 110113002 its reverse (200311011), we get a palindrome (310424013).

The spelling of 110113002 in words is "one hundred ten million, one hundred thirteen thousand, two".

Divisors: 1 2 3 6 9 18 6117389 12234778 18352167 36704334 55056501 110113002