Base | Representation |
---|---|
bin | 1001100110000111100011… |
… | …11111011101011111111111 |
3 | 2202201020012201222210202012 |
4 | 10303003301333131133333 |
5 | 10231204210430143121 |
6 | 112513345424121435 |
7 | 4305330642500606 |
oct | 463036177353777 |
9 | 82636181883665 |
10 | 21100939302911 |
11 | 67a5949155226 |
12 | 2449605a6627b |
13 | ba0a6b866b40 |
14 | 52d410392a3d |
15 | 268d3d028c5b |
hex | 1330f1fdd7ff |
21100939302911 has 4 divisors (see below), whose sum is σ = 22724088480072. Its totient is φ = 19477790125752.
The previous prime is 21100939302901. The next prime is 21100939302973. The reversal of 21100939302911 is 11920393900112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21100939302911 is a prime.
It is a super-2 number, since 2×211009393029112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21100939302901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 811574588561 + ... + 811574588586.
It is an arithmetic number, because the mean of its divisors is an integer number (5681022120018).
Almost surely, 221100939302911 is an apocalyptic number.
21100939302911 is a deficient number, since it is larger than the sum of its proper divisors (1623149177161).
21100939302911 is a wasteful number, since it uses less digits than its factorization.
21100939302911 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1623149177160.
The product of its (nonzero) digits is 26244, while the sum is 41.
The spelling of 21100939302911 in words is "twenty-one trillion, one hundred billion, nine hundred thirty-nine million, three hundred two thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •