Search a number
-
+
1102010102002 = 25310396321717
BaseRepresentation
bin10000000010010100111…
…010111011000011110010
310220100110222102112022001
4100002110322323003302
5121023404041231002
62202131221004214
7142421560212145
oct20022472730362
93810428375261
101102010102002
113953a5a78417
121596b0b5366a
137cbc437b744
143b4a243205c
151d9ec1aba87
hex10094ebb0f2

1102010102002 has 8 divisors (see below), whose sum is σ = 1684204118316. Its totient is φ = 540608729232.

The previous prime is 1102010101991. The next prime is 1102010102003. The reversal of 1102010102002 is 2002010102011.

It can be written as a sum of positive squares in 2 ways, for example, as 1022745893481 + 79264208521 = 1011309^2 + 281539^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5198160753 + ... + 5198160964.

Almost surely, 21102010102002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 10396321772.

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

Adding to 1102010102002 its reverse (2002010102011), we get a palindrome (3104020204013).

Subtracting 1102010102002 from its reverse (2002010102011), we obtain a palindrome (900000000009).

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

Divisors: 1 2 53 106 10396321717 20792643434 551005051001 1102010102002