Search a number
-
+
1111010010013 = 5527201015019
BaseRepresentation
bin10000001010101101010…
…110110110001110011101
310221012201012100020010101
4100022231112312032131
5121200322030310023
62210220240141101
7143160602161051
oct20125526661635
93835635306111
101111010010013
113991a4206522
1215b3a3007791
13809c9ac8bb7
143bab7821c61
151dd7736b1ad
hex102ad5b639d

1111010010013 has 4 divisors (see below), whose sum is σ = 1111211030560. Its totient is φ = 1110808989468.

The previous prime is 1111010009987. The next prime is 1111010010023. The reversal of 1111010010013 is 3100100101111.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 1111010010013 - 213 = 1111010001821 is a prime.

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 100501983 + ... + 100513036.

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

Almost surely, 21111010010013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 201020546.

The product of its (nonzero) digits is 3, while the sum is 10.

Adding to 1111010010013 its reverse (3100100101111), we get a palindrome (4211110111124).

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

Divisors: 1 5527 201015019 1111010010013