Search a number
-
+
1102131613132 = 221125048445753
BaseRepresentation
bin10000000010011100001…
…010011100110111001100
310220100210110001221020021
4100002130022130313030
5121024131143110012
62202151241231524
7142424564066044
oct20023412346714
93810713057207
101102131613132
11395458621540
121597257925a4
137cc135b4414
143b4b4622724
151da07bb0007
hex1009c29cdcc

1102131613132 has 12 divisors (see below), whose sum is σ = 2104069443336. Its totient is φ = 500968915040.

The previous prime is 1102131613097. The next prime is 1102131613153. The reversal of 1102131613132 is 2313161312011.

It is a junction number, because it is equal to n+sod(n) for n = 1102131613097 and 1102131613106.

It is an unprimeable number.

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

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

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

Almost surely, 21102131613132 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 25048445768 (or 25048445766 counting only the distinct ones).

The product of its (nonzero) digits is 648, while the sum is 25.

Adding to 1102131613132 its reverse (2313161312011), we get a palindrome (3415292925143).

The spelling of 1102131613132 in words is "one trillion, one hundred two billion, one hundred thirty-one million, six hundred thirteen thousand, one hundred thirty-two".

Divisors: 1 2 4 11 22 44 25048445753 50096891506 100193783012 275532903283 551065806566 1102131613132