Search a number
-
+
110132002 = 255066001
BaseRepresentation
bin1101001000001…
…11101100100010
321200020021201001
412210013230202
5211143211002
614532302214
72505051361
oct644075442
9250207631
10110132002
1157191892
1230a7196a
1319a80486
14108ab7d8
159a06a87
hex6907b22

110132002 has 4 divisors (see below), whose sum is σ = 165198006. Its totient is φ = 55066000.

The previous prime is 110131979. The next prime is 110132003. The reversal of 110132002 is 200231011.

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

It can be written as a sum of positive squares in only one way, i.e., 109390681 + 741321 = 10459^2 + 861^2 .

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

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27532999 + ... + 27533002.

Almost surely, 2110132002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 55066003.

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

The square root of 110132002 is about 10494.3795433556. The cubic root of 110132002 is about 479.3335687905. Note that the first 3 decimals are identical.

Adding to 110132002 its reverse (200231011), we get a palindrome (310363013).

Subtracting 110132002 from its reverse (200231011), we obtain a palindrome (90099009).

The spelling of 110132002 in words is "one hundred ten million, one hundred thirty-two thousand, two".

Divisors: 1 2 55066001 110132002