Search a number
-
+
1101112001002 = 21342350461577
BaseRepresentation
bin10000000001011111011…
…000111100000111101010
310220021011101111021100001
4100001133120330013222
5121020034133013002
62201502135333214
7142360403402656
oct20013730740752
93807141437301
101101112001002
11394a85022892
121594a022120a
137cab029b530
143b41904ba66
151d998407a87
hex1005f63c1ea

1101112001002 has 8 divisors (see below), whose sum is σ = 1778719386276. Its totient is φ = 508205538912.

The previous prime is 1101112000997. The next prime is 1101112001023. The reversal of 1101112001002 is 2001002111011.

It can be written as a sum of positive squares in 2 ways, for example, as 1085203476361 + 15908524641 = 1041731^2 + 126129^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 1101112001002.

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 in 3 ways as a sum of consecutive naturals, for example, 21175230763 + ... + 21175230814.

Almost surely, 21101112001002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 42350461592.

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

Adding to 1101112001002 its reverse (2001002111011), we get a palindrome (3102114112013).

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

Divisors: 1 2 13 26 42350461577 84700923154 550556000501 1101112001002