Search a number
-
+
1101113012002 = 2550556506001
BaseRepresentation
bin10000000001011111011…
…100110010111100100010
310220021011110101122011111
4100001133130302330202
5121020034412341002
62201502213133534
7142360415113333
oct20013734627442
93807143348144
101101113012002
11394a85653423
121594a062a2aa
137cab0563763
143b41923228a
151d9985573d7
hex1005f732f22

1101113012002 has 4 divisors (see below), whose sum is σ = 1651669518006. Its totient is φ = 550556506000.

The previous prime is 1101113011993. The next prime is 1101113012017. The reversal of 1101113012002 is 2002103111011.

It is a happy number.

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., 1048639488961 + 52473523041 = 1024031^2 + 229071^2 .

It is an unprimeable number.

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

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

Almost surely, 21101113012002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 550556506003.

The product of its (nonzero) digits is 12, while the sum is 13.

Adding to 1101113012002 its reverse (2002103111011), we get a palindrome (3103216123013).

Subtracting 1101113012002 from its reverse (2002103111011), we obtain a palindrome (900990099009).

The spelling of 1101113012002 in words is "one trillion, one hundred one billion, one hundred thirteen million, twelve thousand, two".

Divisors: 1 2 550556506001 1101113012002