Search a number
-
+
11010102002 = 25505051001
BaseRepresentation
bin10100100000100000…
…01101001011110010
31001102022110010120122
422100100031023302
5140022041231002
65020304410242
7536561215514
oct122020151362
931368403518
1011010102002
11473aa08659
122173316982
131066053773
1476637dbb4
154468d76a2
hex29040d2f2

11010102002 has 4 divisors (see below), whose sum is σ = 16515153006. Its totient is φ = 5505051000.

The previous prime is 11010101959. The next prime is 11010102017. The reversal of 11010102002 is 20020101011.

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., 8170171321 + 2839930681 = 90389^2 + 53291^2 .

It is an unprimeable number.

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, 2752525499 + ... + 2752525502.

Almost surely, 211010102002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5505051003.

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

Adding to 11010102002 its reverse (20020101011), we get a palindrome (31030203013).

Subtracting 11010102002 from its reverse (20020101011), we obtain a palindrome (9009999009).

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

Divisors: 1 2 5505051001 11010102002