Search a number
-
+
1111013310001 = 7158716187143
BaseRepresentation
bin10000001010101101100…
…011011011111000110001
310221012201102112212212011
4100022231203123320301
5121200323401410001
62210220435002521
7143160642214030
oct20125543337061
93835642485764
101111013310001
113991a605a891
1215b3a4139441
13809ca6b2c5a
143bab8040717
151dd777bdd51
hex102ad8dbe31

1111013310001 has 4 divisors (see below), whose sum is σ = 1269729497152. Its totient is φ = 952297122852.

The previous prime is 1111013309981. The next prime is 1111013310031. The reversal of 1111013310001 is 1000133101111.

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 1111013310001 - 27 = 1111013309873 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (1111013310031) 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, 79358093565 + ... + 79358093578.

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

Almost surely, 21111013310001 is an apocalyptic number.

It is an amenable number.

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

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

1111013310001 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 158716187150.

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

Adding to 1111013310001 its reverse (1000133101111), we get a palindrome (2111146411112).

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

Divisors: 1 7 158716187143 1111013310001