Base | Representation |
---|---|
bin | 1001100110000110011011… |
… | …01100010011101010110011 |
3 | 2202201011122022001100201202 |
4 | 10303003031230103222303 |
5 | 10231201434024132011 |
6 | 112513205151121415 |
7 | 4305306566203253 |
oct | 463031554235263 |
9 | 82634568040652 |
10 | 21100330302131 |
11 | 67a56664099a3 |
12 | 2449475b1326b |
13 | ba09a2639452 |
14 | 52d393545963 |
15 | 268d0482e23b |
hex | 1330cdb13ab3 |
21100330302131 has 16 divisors (see below), whose sum is σ = 21700922816160. Its totient is φ = 20503870168320.
The previous prime is 21100330302101. The next prime is 21100330302167. The reversal of 21100330302131 is 13120303300112.
It is a cyclic number.
It is not a de Polignac number, because 21100330302131 - 210 = 21100330301107 is a prime.
It is a super-2 number, since 2×211003303021312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21100330302101) 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 15 ways as a sum of consecutive naturals, for example, 42845465 + ... + 43335141.
It is an arithmetic number, because the mean of its divisors is an integer number (1356307676010).
Almost surely, 221100330302131 is an apocalyptic number.
21100330302131 is a deficient number, since it is larger than the sum of its proper divisors (600592514029).
21100330302131 is a wasteful number, since it uses less digits than its factorization.
21100330302131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 493894.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 21100330302131 its reverse (13120303300112), we get a palindrome (34220633602243).
The spelling of 21100330302131 in words is "twenty-one trillion, one hundred billion, three hundred thirty million, three hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •