Search a number
-
+
911011200220001 = 5940138505904739
BaseRepresentation
bin1100111100100011110101001…
…0111110011011101101100001
311102110121211010220200120022202
43033020331102332123231201
51423402001414224020001
612545320433455542545
7362614246543441316
oct31710752276335541
94373554126616282
10911011200220001
11244304753569441
12862140a782aa55
1330143cab8935aa
14120d726a948d0d
15704c75a62496b
hex33c8f52f9bb61

911011200220001 has 8 divisors (see below), whose sum is σ = 928762422328800. Its totient is φ = 893336989921600.

The previous prime is 911011200219997. The next prime is 911011200220019. The reversal of 911011200220001 is 100022002110119.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 911011200220001 - 22 = 911011200219997 is a prime.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19252928711 + ... + 19252976028.

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

Almost surely, 2911011200220001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 38505905199.

The product of its (nonzero) digits is 72, while the sum is 20.

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

Divisors: 1 59 401 23659 38505904739 2271848379601 15440867800339 911011200220001