Search a number
-
+
112000121102002 = 2773109589159591
BaseRepresentation
bin11001011101110100001111…
…011011101101111010110010
3112200120002220000021020210111
4121131310033123231322302
5104140002222000231002
61034112051220251534
732406512260415650
oct3135641733557262
9480502800236714
10112000121102002
1132760a91585781
121068a459b40baa
134a65748957203
141d92b98915dd0
15ce35a81623d7
hex65dd0f6edeb2

112000121102002 has 16 divisors (see below), whose sum is σ = 194630347435392. Its totient is φ = 47342516942880.

The previous prime is 112000121101993. The next prime is 112000121102059. The reversal of 112000121102002 is 200201121000211.

It is a super-2 number, since 2×1120001211020022 (a number of 29 digits) contains 22 as substring.

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54794578774 + ... + 54794580817.

It is an arithmetic number, because the mean of its divisors is an integer number (12164396714712).

Almost surely, 2112000121102002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 109589159673.

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

Adding to 112000121102002 its reverse (200201121000211), we get a palindrome (312201242102213).

The spelling of 112000121102002 in words is "one hundred twelve trillion, one hundred twenty-one million, one hundred two thousand, two".

Divisors: 1 2 7 14 73 146 511 1022 109589159591 219178319182 767124117137 1534248234274 8000008650143 16000017300286 56000060551001 112000121102002