Base | Representation |
---|---|
bin | 1001100100000011110101… |
… | …10110111110001101000011 |
3 | 2202110110200021020111100002 |
4 | 10302001322312332031003 |
5 | 10224024343101042011 |
6 | 112421052235550215 |
7 | 4300245325004360 |
oct | 462017266761503 |
9 | 82413607214302 |
10 | 21030221112131 |
11 | 6778959619860 |
12 | 243796a5bb36b |
13 | b971ab6b133a |
14 | 529c22229467 |
15 | 26709e850c3b |
hex | 13207adbe343 |
21030221112131 has 16 divisors (see below), whose sum is σ = 26219645484288. Its totient is φ = 16387092136800.
The previous prime is 21030221112083. The next prime is 21030221112143. The reversal of 21030221112131 is 13121112203012.
It is a de Polignac number, because none of the positive numbers 2k-21030221112131 is a prime.
It is a super-2 number, since 2×210302211121312 (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 (21030221112161) 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, 14901341 + ... + 16251473.
It is an arithmetic number, because the mean of its divisors is an integer number (1638727842768).
Almost surely, 221030221112131 is an apocalyptic number.
21030221112131 is a deficient number, since it is larger than the sum of its proper divisors (5189424372157).
21030221112131 is a wasteful number, since it uses less digits than its factorization.
21030221112131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1552442.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 21030221112131 its reverse (13121112203012), we get a palindrome (34151333315143).
The spelling of 21030221112131 in words is "twenty-one trillion, thirty billion, two hundred twenty-one million, one hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •