Base | Representation |
---|---|
bin | 1001101100011111110101… |
… | …10011001011101100111001 |
3 | 2210111011222112201210211120 |
4 | 10312033322303023230321 |
5 | 10243302111341130241 |
6 | 113202155510215453 |
7 | 4330220464253160 |
oct | 466177263135471 |
9 | 83434875653746 |
10 | 21320130411321 |
11 | 687a8a88911a5 |
12 | 2483b98654589 |
13 | bb8630ab6861 |
14 | 539c851583d7 |
15 | 26e8bb1d7666 |
hex | 1363faccbb39 |
21320130411321 has 64 divisors (see below), whose sum is σ = 35052657278976. Its totient is φ = 11250002995200.
The previous prime is 21320130411319. The next prime is 21320130411337. The reversal of 21320130411321 is 12311403102312.
It is not a de Polignac number, because 21320130411321 - 21 = 21320130411319 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21320130411291 and 21320130411300.
It is not an unprimeable number, because it can be changed into a prime (21320130411121) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2836066 + ... + 7119236.
It is an arithmetic number, because the mean of its divisors is an integer number (547697769984).
Almost surely, 221320130411321 is an apocalyptic number.
21320130411321 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
21320130411321 is a deficient number, since it is larger than the sum of its proper divisors (13732526867655).
21320130411321 is a wasteful number, since it uses less digits than its factorization.
21320130411321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4283462.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 21320130411321 its reverse (12311403102312), we get a palindrome (33631533513633).
The spelling of 21320130411321 in words is "twenty-one trillion, three hundred twenty billion, one hundred thirty million, four hundred eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •