Base | Representation |
---|---|
bin | 1001101011111010111101… |
… | …01011001111000110100101 |
3 | 2210102021212201001100000020 |
4 | 10311331132223033012211 |
5 | 10242441034242310341 |
6 | 113145123112505353 |
7 | 4325620030663434 |
oct | 465753653170645 |
9 | 83367781040006 |
10 | 21300331213221 |
11 | 6872468742665 |
12 | 24801919ab259 |
13 | bb67c6bb7218 |
14 | 538d277c311b |
15 | 26e10cdd3566 |
hex | 135f5eacf1a5 |
21300331213221 has 8 divisors (see below), whose sum is σ = 29316584895744. Its totient is φ = 13742149169760.
The previous prime is 21300331213157. The next prime is 21300331213241. The reversal of 21300331213221 is 12231213300312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21300331213221 - 26 = 21300331213157 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21300331213191 and 21300331213200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21300331213241) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 114517909656 + ... + 114517909841.
It is an arithmetic number, because the mean of its divisors is an integer number (3664573111968).
Almost surely, 221300331213221 is an apocalyptic number.
It is an amenable number.
21300331213221 is a deficient number, since it is larger than the sum of its proper divisors (8016253682523).
21300331213221 is a wasteful number, since it uses less digits than its factorization.
21300331213221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229035819531.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 21300331213221 its reverse (12231213300312), we get a palindrome (33531544513533).
The spelling of 21300331213221 in words is "twenty-one trillion, three hundred billion, three hundred thirty-one million, two hundred thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •