Search a number
-
+
110001001100002 = 255000500550001
BaseRepresentation
bin11001000000101110011010…
…100110000111001011100010
3112102110222210220021221010221
4121000232122212013023202
5103404224022240200002
61025541432352513254
732112211231651465
oct3100563246071342
9472428726257127
10110001001100002
1132060187445471
1210406b2084b82a
13494c08580521c
141d24110c972dc
15cab5a255ec37
hex640b9a9872e2

110001001100002 has 4 divisors (see below), whose sum is σ = 165001501650006. Its totient is φ = 55000500550000.

The previous prime is 110001001099999. The next prime is 110001001100017. The reversal of 110001001100002 is 200001100100011.

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., 94924080924201 + 15076920175801 = 9742899^2 + 3882901^2 .

It is an unprimeable number.

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

Almost surely, 2110001001100002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 55000500550003.

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

Adding to 110001001100002 its reverse (200001100100011), we get a palindrome (310002101200013).

Subtracting 110001001100002 from its reverse (200001100100011), we obtain a palindrome (90000099000009).

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

Divisors: 1 2 55000500550001 110001001100002