Search a number
-
+
110000210002 = 255000105001
BaseRepresentation
bin110011001110010000…
…1100000000001010010
3101111221002210122102221
41212130201200001102
53300240023210002
6122311114131254
710642623233464
oct1463441400122
9344832718387
10110000210002
1142718283971
121939aa20b2a
13a4b0571677
14547723a134
152cdc139c37
hex199c860052

110000210002 has 4 divisors (see below), whose sum is σ = 165000315006. Its totient is φ = 55000105000.

The previous prime is 110000209997. The next prime is 110000210009. The reversal of 110000210002 is 200012000011.

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., 105378793641 + 4621416361 = 324621^2 + 67981^2 .

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

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

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

Almost surely, 2110000210002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 55000105003.

The product of its (nonzero) digits is 4, while the sum is 7.

Adding to 110000210002 its reverse (200012000011), we get a palindrome (310012210013).

The spelling of 110000210002 in words is "one hundred ten billion, two hundred ten thousand, two".

Divisors: 1 2 55000105001 110000210002