Base | Representation |
---|---|
bin | 1011000111010100001101… |
… | …0111111011010110101101 |
3 | 1121021020202120112200202011 |
4 | 2301311003113323112231 |
5 | 3100204144422144041 |
6 | 41553533423201221 |
7 | 2400613505463604 |
oct | 261650327732655 |
9 | 47236676480664 |
10 | 12220312303021 |
11 | 3991672791999 |
12 | 1454465a46211 |
13 | 6a84a8001374 |
14 | 30367563ca3b |
15 | 162d2974ee81 |
hex | b1d435fb5ad |
12220312303021 has 2 divisors, whose sum is σ = 12220312303022. Its totient is φ = 12220312303020.
The previous prime is 12220312302929. The next prime is 12220312303051. The reversal of 12220312303021 is 12030321302221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11488106926921 + 732205376100 = 3389411^2 + 855690^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12220312303021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12220312302983 and 12220312303001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12220312303051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6110156151510 + 6110156151511.
It is an arithmetic number, because the mean of its divisors is an integer number (6110156151511).
Almost surely, 212220312303021 is an apocalyptic number.
It is an amenable number.
12220312303021 is a deficient number, since it is larger than the sum of its proper divisors (1).
12220312303021 is an equidigital number, since it uses as much as digits as its factorization.
12220312303021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 12220312303021 its reverse (12030321302221), we get a palindrome (24250633605242).
The spelling of 12220312303021 in words is "twelve trillion, two hundred twenty billion, three hundred twelve million, three hundred three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •