Search a number
-
+
1011111111002 = 2505555555501
BaseRepresentation
bin11101011011010101110…
…10110010100101011010
310120122212001221100100202
432231222322302211122
5113031223421023002
62052255324102202
7133023163431446
oct16555272624532
93518761840322
101011111111002
1135a89a954063
12143b63094962
1374469227135
1436d1bd9b826
151b47be52502
hexeb6aeb295a

1011111111002 has 4 divisors (see below), whose sum is σ = 1516666666506. Its totient is φ = 505555555500.

The previous prime is 1011111110899. The next prime is 1011111111007. The reversal of 1011111111002 is 2001111111101.

It is a happy number.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in only one way, i.e., 1011108680521 + 2430481 = 1005539^2 + 1559^2 .

It is a super-3 number, since 3×10111111110023 (a number of 37 digits) contains 333 as substring.

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

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 252777777749 + ... + 252777777752.

Almost surely, 21011111111002 is an apocalyptic number.

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

1011111111002 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 505555555503.

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

Adding to 1011111111002 its reverse (2001111111101), we get a palindrome (3012222222103).

Subtracting 1011111111002 from its reverse (2001111111101), we obtain a palindrome (990000000099).

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

Divisors: 1 2 505555555501 1011111111002