Base | Representation |
---|---|
bin | 1010001100100001010111… |
… | …0010000111000010001111 |
3 | 1110200200120012200021221112 |
4 | 2203020111302013002033 |
5 | 2432132022401200421 |
6 | 35501524132122235 |
7 | 2234624644433150 |
oct | 243102562070217 |
9 | 43620505607845 |
10 | 11210230100111 |
11 | 36322607067a9 |
12 | 131074b46637b |
13 | 634173cc63b3 |
14 | 2aa814195927 |
15 | 14690ccde45b |
hex | a3215c8708f |
11210230100111 has 4 divisors (see below), whose sum is σ = 12811691542992. Its totient is φ = 9608768657232.
The previous prime is 11210230100093. The next prime is 11210230100159. The reversal of 11210230100111 is 11100103201211.
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 11210230100111 - 234 = 11193050230927 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11210230100171) 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 3 ways as a sum of consecutive naturals, for example, 800730721430 + ... + 800730721443.
It is an arithmetic number, because the mean of its divisors is an integer number (3202922885748).
Almost surely, 211210230100111 is an apocalyptic number.
11210230100111 is a deficient number, since it is larger than the sum of its proper divisors (1601461442881).
11210230100111 is an equidigital number, since it uses as much as digits as its factorization.
11210230100111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1601461442880.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 11210230100111 its reverse (11100103201211), we get a palindrome (22310333301322).
The spelling of 11210230100111 in words is "eleven trillion, two hundred ten billion, two hundred thirty million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •