Search a number
-
+
11011110101210 = 251957953211059
BaseRepresentation
bin1010000000111011100101…
…0011100110000011011010
31102222122121012021022000102
42200032321103212003122
52420401223141214320
635230233435335402
72214345400402052
oct240167123460332
942878535238012
1011011110101210
11356587065843a
12129a03a5b1562
1361b4600bab3b
142a0d24d06562
15141656c46175
hexa03b94e60da

11011110101210 has 16 divisors (see below), whose sum is σ = 20863155981600. Its totient is φ = 4172631196176.

The previous prime is 11011110101203. The next prime is 11011110101227. The reversal of 11011110101210 is 1210101111011.

It is a happy number.

It is a Curzon number.

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

It is an unprimeable number.

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

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

Almost surely, 211011110101210 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 57953211085.

The product of its (nonzero) digits is 2, while the sum is 11.

Adding to 11011110101210 its reverse (1210101111011), we get a palindrome (12221211212221).

The spelling of 11011110101210 in words is "eleven trillion, eleven billion, one hundred ten million, one hundred one thousand, two hundred ten".

Divisors: 1 2 5 10 19 38 95 190 57953211059 115906422118 289766055295 579532110590 1101111010121 2202222020242 5505555050605 11011110101210