Base | Representation |
---|---|
bin | 1001100011110100111011… |
… | …00010111100111110110011 |
3 | 2202102201000011210222001012 |
4 | 10301322131202330332303 |
5 | 10223411443030212321 |
6 | 112413245453101135 |
7 | 4266543016210214 |
oct | 461723542747663 |
9 | 82381004728035 |
10 | 21022213132211 |
11 | 677551a2a0a35 |
12 | 24362b47877ab |
13 | b96503605c95 |
14 | 5296a288540b |
15 | 266c817cb05b |
hex | 131e9d8bcfb3 |
21022213132211 has 4 divisors (see below), whose sum is σ = 22258813904712. Its totient is φ = 19785612359712.
The previous prime is 21022213132201. The next prime is 21022213132243. The reversal of 21022213132211 is 11223131222012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21022213132211 - 210 = 21022213131187 is a prime.
It is a super-2 number, since 2×210222131322112 (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 (21022213132201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 618300386225 + ... + 618300386258.
It is an arithmetic number, because the mean of its divisors is an integer number (5564703476178).
Almost surely, 221022213132211 is an apocalyptic number.
21022213132211 is a deficient number, since it is larger than the sum of its proper divisors (1236600772501).
21022213132211 is a wasteful number, since it uses less digits than its factorization.
21022213132211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1236600772500.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 21022213132211 its reverse (11223131222012), we get a palindrome (32245344354223).
The spelling of 21022213132211 in words is "twenty-one trillion, twenty-two billion, two hundred thirteen million, one hundred thirty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •