Search a number
-
+
1101011112310 = 25110101111231
BaseRepresentation
bin10000000001011001011…
…000000101000101110110
310220020220100122121001211
4100001121120011011312
5121014332321043220
62201444133112034
7142355040016564
oct20013130050566
93806810577054
101101011112310
11394a330846aa
1215947248861a
137ca95406395
143b4098a8a34
151d98e629b5a
hex10059605176

1101011112310 has 8 divisors (see below), whose sum is σ = 1981820002176. Its totient is φ = 440404444920.

The previous prime is 1101011112307. The next prime is 1101011112337. The reversal of 1101011112310 is 132111101011.

It is a sphenic number, since it is the product of 3 distinct primes.

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 21101011112310 is an apocalyptic number.

1101011112310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 110101111238.

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

Adding to 1101011112310 its reverse (132111101011), we get a palindrome (1233122213321).

The spelling of 1101011112310 in words is "one trillion, one hundred one billion, eleven million, one hundred twelve thousand, three hundred ten".

Divisors: 1 2 5 10 110101111231 220202222462 550505556155 1101011112310