Search a number
-
+
10911019282001 = 55109197989789
BaseRepresentation
bin1001111011000110101101…
…1011011010111001010001
31102122002020200201212020022
42132301223123122321101
52412231231414011001
635112241505553225
72204203141436366
oct236615333327121
942562220655208
1010911019282001
113527378a31543
121282766345815
13611b9b830627
1429a14bba446d
1513dc49a6c11b
hex9ec6b6dae51

10911019282001 has 4 divisors (see below), whose sum is σ = 10911217326900. Its totient is φ = 10910821237104.

The previous prime is 10911019281997. The next prime is 10911019282057. The reversal of 10911019282001 is 10028291011901.

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 2 ways, for example, as 7214859230401 + 3696160051600 = 2686049^2 + 1922540^2 .

It is a cyclic number.

It is not a de Polignac number, because 10911019282001 - 22 = 10911019281997 is a prime.

It is a Duffinian number.

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

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

Almost surely, 210911019282001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 198044898.

The product of its (nonzero) digits is 2592, while the sum is 35.

The spelling of 10911019282001 in words is "ten trillion, nine hundred eleven billion, nineteen million, two hundred eighty-two thousand, one".

Divisors: 1 55109 197989789 10911019282001