Search a number
-
+
1011002011011 = 32112333556779
BaseRepresentation
bin11101011011001000110…
…10100110110110000011
310120122120110122111022100
432231210122212312003
5113031013003323021
62052240425441443
7133020400205616
oct16554432466603
93518513574270
101011002011011
1135a844307683
12143b32640283
137444c748625
1436d0b6bc17d
151b4725a1626
hexeb646a6d83

1011002011011 has 6 divisors (see below), whose sum is σ = 1460336238140. Its totient is φ = 674001340668.

The previous prime is 1011002011009. The next prime is 1011002011031. The reversal of 1011002011011 is 1101102001101.

It is not a de Polignac number, because 1011002011011 - 21 = 1011002011009 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 112333556779 = 1011002011011 / (1 + 0 + 1 + 1 + 0 + 0 + 2 + 0 + 1 + 1 + 0 + 1 + 1).

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 56166778381 + ... + 56166778398.

Almost surely, 21011002011011 is an apocalyptic number.

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

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

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

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

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

Adding to 1011002011011 its reverse (1101102001101), we get a palindrome (2112104012112).

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

Divisors: 1 3 9 112333556779 337000670337 1011002011011