Base | Representation |
---|---|
bin | 1001101100010001000111… |
… | …11001100011000101010101 |
3 | 2210110102120221201220022110 |
4 | 10312020203321203011111 |
5 | 10243134421340324341 |
6 | 113154411525221233 |
7 | 4326520633050552 |
oct | 466104371430525 |
9 | 83412527656273 |
10 | 21312230011221 |
11 | 6877514261716 |
12 | 2482552861819 |
13 | bb79720a70b6 |
14 | 539735bb9a29 |
15 | 26e5a7813216 |
hex | 136223e63155 |
21312230011221 has 8 divisors (see below), whose sum is σ = 28425107037280. Its totient is φ = 14203753162992.
The previous prime is 21312230011211. The next prime is 21312230011271. The reversal of 21312230011221 is 12211003221312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21312230011221 - 242 = 16914183500117 is a prime.
It is a super-2 number, since 2×213122300112212 (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 (21312230011211) 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, 1100033155 + ... + 1100052528.
It is an arithmetic number, because the mean of its divisors is an integer number (3553138379660).
Almost surely, 221312230011221 is an apocalyptic number.
It is an amenable number.
21312230011221 is a deficient number, since it is larger than the sum of its proper divisors (7112877026059).
21312230011221 is a wasteful number, since it uses less digits than its factorization.
21312230011221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2200088915.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 21312230011221 its reverse (12211003221312), we get a palindrome (33523233232533).
The spelling of 21312230011221 in words is "twenty-one trillion, three hundred twelve billion, two hundred thirty million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •