Search a number
-
+
11021010112010 = 251958005316379
BaseRepresentation
bin1010000001100000011101…
…1001001000111000001010
31110000121011010212221202002
42200120013121020320022
52421032012042041020
635234552051111002
72215145622165233
oct240300731107012
943017133787662
1011021010112010
113569a90989048
12129bb41ba2462
1361c37a1696b2
142a15c3a7c08a
15141a35e52975
hexa0607648e0a

11021010112010 has 16 divisors (see below), whose sum is σ = 20881913896800. Its totient is φ = 4176382779216.

The previous prime is 11021010112001. The next prime is 11021010112039. The reversal of 11021010112010 is 1021101012011.

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

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, 29002658000 + ... + 29002658379.

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

Almost surely, 211021010112010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 58005316405.

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

Adding to 11021010112010 its reverse (1021101012011), we get a palindrome (12042111124021).

Subtracting from 11021010112010 its reverse (1021101012011), we obtain a palindrome (9999909099999).

The spelling of 11021010112010 in words is "eleven trillion, twenty-one billion, ten million, one hundred twelve thousand, ten".

Divisors: 1 2 5 10 19 38 95 190 58005316379 116010632758 290026581895 580053163790 1102101011201 2204202022402 5510505056005 11021010112010