Search a number
-
+
1100113012131 = 37192757175469
BaseRepresentation
bin10000000000100011110…
…110000110010110100011
310220011120202201101020020
4100000203312012112203
5121011012412342011
62201215051444523
7142323553212660
oct20004366062643
93804522641206
101100113012131
1139461212a751
12159261756743
137c981326663
143b3624c4a67
151d93a876006
hex10023d865a3

1100113012131 has 16 divisors (see below), whose sum is σ = 1764592300800. Its totient is φ = 595549901088.

The previous prime is 1100113012127. The next prime is 1100113012133. The reversal of 1100113012131 is 1312103110011.

It is not a de Polignac number, because 1100113012131 - 22 = 1100113012127 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 1100113012131.

It is not an unprimeable number, because it can be changed into a prime (1100113012133) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1378587336 + ... + 1378588133.

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

Almost surely, 21100113012131 is an apocalyptic number.

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

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

1100113012131 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 2757175498.

The product of its (nonzero) digits is 18, while the sum is 15.

Adding to 1100113012131 its reverse (1312103110011), we get a palindrome (2412216122142).

The spelling of 1100113012131 in words is "one trillion, one hundred billion, one hundred thirteen million, twelve thousand, one hundred thirty-one".

Divisors: 1 3 7 19 21 57 133 399 2757175469 8271526407 19300228283 52386333911 57900684849 157159001733 366704337377 1100113012131