Search a number
-
+
1011020110011 = 32487230668517
BaseRepresentation
bin11101011011001010111…
…11101001100010111011
310120122121201201000110200
432231211133221202323
5113031032122010021
62052242313413243
7133021010066442
oct16554537514273
93518551630420
101011020110011
1135a85354972a
12143b3870a223
13744534146b2
1436d0dc6dd59
151b473e79126
hexeb657e98bb

1011020110011 has 12 divisors (see below), whose sum is σ = 1463361078192. Its totient is φ = 672629392656.

The previous prime is 1011020110007. The next prime is 1011020110019. The reversal of 1011020110011 is 1100110201101.

It is not a de Polignac number, because 1011020110011 - 22 = 1011020110007 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 115329876 + ... + 115338641.

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

Almost surely, 21011020110011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 230669010 (or 230669007 counting only the distinct ones).

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

Adding to 1011020110011 its reverse (1100110201101), we get a palindrome (2111130311112).

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

Divisors: 1 3 9 487 1461 4383 230668517 692005551 2076016653 112335567779 337006703337 1011020110011