Base | Representation |
---|---|
bin | 1010000000111011100010… |
… | …1101011110110010010111 |
3 | 1102222122120111110200121200 |
4 | 2200032320231132302113 |
5 | 2420401213112004400 |
6 | 35230232441243543 |
7 | 2214345216440100 |
oct | 240167055366227 |
9 | 42878514420550 |
10 | 11011100109975 |
11 | 3565865a53919 |
12 | 129a0371935b3 |
13 | 61b45b000274 |
14 | 2a0d238653a7 |
15 | 141655e20b00 |
hex | a03b8b5ec97 |
11011100109975 has 108 divisors (see below), whose sum is σ = 24291571181904. Its totient is φ = 4737548874240.
The previous prime is 11011100109973. The next prime is 11011100109979. The reversal of 11011100109975 is 57990100111011.
It is not a de Polignac number, because 11011100109975 - 21 = 11011100109973 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011100109973) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 107 ways as a sum of consecutive naturals, for example, 29187259 + ... + 29562108.
It is an arithmetic number, because the mean of its divisors is an integer number (224921955388).
Almost surely, 211011100109975 is an apocalyptic number.
11011100109975 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11011100109975 is an abundant number, since it is smaller than the sum of its proper divisors (13280471071929).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011100109975 is a wasteful number, since it uses less digits than its factorization.
11011100109975 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58749414 (or 58749399 counting only the distinct ones).
The product of its (nonzero) digits is 2835, while the sum is 36.
The spelling of 11011100109975 in words is "eleven trillion, eleven billion, one hundred million, one hundred nine thousand, nine hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •