Search a number
-
+
1101010200011 = 17731376475883
BaseRepresentation
bin10000000001011001010…
…100100110010111001011
310220020220021221020121222
4100001121110212113023
5121014332102400021
62201444101352255
7142355026200041
oct20013124462713
93806807836558
101101010200011
11394a32611237
1215947210868b
137ca95177067
143b40970c391
151d98e4e96ab
hex100595265cb

1101010200011 has 16 divisors (see below), whose sum is σ = 1190371093344. Its totient is φ = 1014589384704.

The previous prime is 1101010199899. The next prime is 1101010200041. The reversal of 1101010200011 is 1100020101011.

It is a happy number.

It is not a de Polignac number, because 1101010200011 - 210 = 1101010198987 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 21101010200011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 6476110.

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

Adding to 1101010200011 its reverse (1100020101011), we get a palindrome (2201030301022).

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

Divisors: 1 17 73 137 1241 2329 10001 170017 6475883 110090011 472739459 887195971 8036570803 15082331507 64765305883 1101010200011