Search a number
-
+
1102101110002 = 2551050555001
BaseRepresentation
bin10000000010011010010…
…110000101110011110010
310220100201022200012210201
4100002122112011303302
5121024100341010002
62202144231345414
7142424043603454
oct20023226056362
93810638605721
101102101110002
11395442388042
1215971752226a
137cc0a194429
143b4b05622d4
151da05187087
hex1009a585cf2

1102101110002 has 4 divisors (see below), whose sum is σ = 1653151665006. Its totient is φ = 551050555000.

The previous prime is 1102101109987. The next prime is 1102101110017. The reversal of 1102101110002 is 2000111012011.

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

It is an interprime number because it is at equal distance from previous prime (1102101109987) and next prime (1102101110017).

It can be written as a sum of positive squares in only one way, i.e., 985594258441 + 116506851561 = 992771^2 + 341331^2 .

It is an unprimeable number.

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

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

Almost surely, 21102101110002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 551050555003.

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

Adding to 1102101110002 its reverse (2000111012011), we get a palindrome (3102212122013).

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

Divisors: 1 2 551050555001 1102101110002