Search a number
-
+
1011011011010 = 257111310129901
BaseRepresentation
bin11101011011001001111…
…00111100000111000010
310120122121002120201222122
432231210330330013002
5113031022304323020
62052241350404242
7133020536541650
oct16554474740702
93518532521878
101011011011010
1135a8493a44a0
12143b35660682
1374451579c80
1436d0c981dd0
151b47327d125
hexeb64f3c1c2

1011011011010 has 192 divisors, whose sum is σ = 2468075242752. Its totient is φ = 287971200000.

The previous prime is 1011011010953. The next prime is 1011011011019. The reversal of 1011011011010 is 101101101101.

It is a Curzon number.

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

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 102107060 + ... + 102116960.

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

Almost surely, 21011011011010 is an apocalyptic number.

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

1011011011010 is an abundant number, since it is smaller than the sum of its proper divisors (1457064231742).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

Adding to 1011011011010 its reverse (101101101101), we get a palindrome (1112112112111).

Subtracting from 1011011011010 its reverse (101101101101), we obtain a palindrome (909909909909).

It can be divided in two parts, 101101 and 1011010, that added together give a palindrome (1112111).

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