Base | Representation |
---|---|
bin | 1010000101101110010001… |
… | …0100011100001100010011 |
3 | 1110021112002122012110111220 |
4 | 2201123210110130030103 |
5 | 2423223324121400000 |
6 | 35332130523540123 |
7 | 2223321455131032 |
oct | 241334424341423 |
9 | 43245078173456 |
10 | 11093436121875 |
11 | 3597777538248 |
12 | 12b1b9538a643 |
13 | 6261500a8733 |
14 | 2a4cd4964719 |
15 | 1438745261a0 |
hex | a16e451c313 |
11093436121875 has 96 divisors (see below), whose sum is σ = 19090802110464. Its totient is φ = 5723682000000.
The previous prime is 11093436121861. The next prime is 11093436121877. The reversal of 11093436121875 is 57812163439011.
It is not a de Polignac number, because 11093436121875 - 212 = 11093436117779 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11093436121877) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1276130029 + ... + 1276138721.
It is an arithmetic number, because the mean of its divisors is an integer number (198862521984).
It is a 1-persistent number, because it is pandigital, but 2⋅11093436121875 = 22186872243750 is not.
Almost surely, 211093436121875 is an apocalyptic number.
11093436121875 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11093436121875 is a deficient number, since it is larger than the sum of its proper divisors (7997365988589).
11093436121875 is an frugal number, since it uses more digits than its factorization.
11093436121875 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13143 (or 13123 counting only the distinct ones).
The product of its (nonzero) digits is 1088640, while the sum is 51.
The spelling of 11093436121875 in words is "eleven trillion, ninety-three billion, four hundred thirty-six million, one hundred twenty-one thousand, eight hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •