Search a number
-
+
11000701105202 = 25699666696929
BaseRepresentation
bin1010000000010100110011…
…1000011011010000110010
31102221122201202220111211202
42200011030320123100302
52420213413440331302
635221352522411202
72213526425366654
oct240051470332062
942848652814752
1011000701105202
113561409a936a6
121298014660b02
1361a49175c4c3
142a061871a6d4
15141247ee9202
hexa014ce1b432

11000701105202 has 8 divisors (see below), whose sum is σ = 16530051750300. Its totient is φ = 5490683855104.

The previous prime is 11000701105171. The next prime is 11000701105249. The reversal of 11000701105202 is 20250110700011.

It is a happy number.

It can be written as a sum of positive squares in 2 ways, for example, as 11000160589201 + 540516001 = 3316649^2 + 23249^2 .

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

It is an unprimeable number.

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

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

Almost surely, 211000701105202 is an apocalyptic number.

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

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

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

The sum of its prime factors is 9666697500.

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

Adding to 11000701105202 its reverse (20250110700011), we get a palindrome (31250811805213).

The spelling of 11000701105202 in words is "eleven trillion, seven hundred one million, one hundred five thousand, two hundred two".

Divisors: 1 2 569 1138 9666696929 19333393858 5500350552601 11000701105202