Search a number
-
+
11005000105051 = 23478478265437
BaseRepresentation
bin1010000000100100110100…
…0111110011110001011011
31102222001211101020022222101
42200021031013303301123
52420301220011330201
635223343253104231
72214041106316141
oct240111507636133
942861741208871
1011005000105051
113563215728937
121298a14328077
1361a9c82bb6b4
142a0905663591
151413ea631d01
hexa024d1f3c5b

11005000105051 has 4 divisors (see below), whose sum is σ = 11483478370512. Its totient is φ = 10526521839592.

The previous prime is 11005000105049. The next prime is 11005000105061. The reversal of 11005000105051 is 15050100050011.

It is a happy number.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 11005000105051 - 21 = 11005000105049 is a prime.

It is a super-3 number, since 3×110050001050513 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a Duffinian number.

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

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

Almost surely, 211005000105051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 478478265460.

The product of its (nonzero) digits is 125, while the sum is 19.

Adding to 11005000105051 its reverse (15050100050011), we get a palindrome (26055100155062).

The spelling of 11005000105051 in words is "eleven trillion, five billion, one hundred five thousand, fifty-one".

Divisors: 1 23 478478265437 11005000105051