Search a number
-
+
1101121300010 = 25547201301883
BaseRepresentation
bin10000000001011111111…
…100011010011000101010
310220021012000222201011202
4100001133330122120222
5121020044023100020
62201503110524202
7142360545422534
oct20013774323052
93807160881152
101101121300010
11394a8a2a4316
121594a3366662
137cab21a5cc4
143b41a38c854
151d999142e75
hex1005ff1a62a

1101121300010 has 16 divisors (see below), whose sum is σ = 1985641783776. Its totient is φ = 439643310288.

The previous prime is 1101121300007. The next prime is 1101121300031. The reversal of 1101121300010 is 100031211011.

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 = 1101121299964 and 1101121300000.

It is an unprimeable number.

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

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

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

Almost surely, 21101121300010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 201302437.

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

Adding to 1101121300010 its reverse (100031211011), we get a palindrome (1201152511021).

The spelling of 1101121300010 in words is "one trillion, one hundred one billion, one hundred twenty-one million, three hundred thousand, ten".

Divisors: 1 2 5 10 547 1094 2735 5470 201301883 402603766 1006509415 2013018830 110112130001 220224260002 550560650005 1101121300010