Base | Representation |
---|---|
bin | 1011000111010011110111… |
… | …1100000001010111001001 |
3 | 1121021020112012221011210112 |
4 | 2301310331330001113021 |
5 | 3100204003100222023 |
6 | 41553520404324105 |
7 | 2400611320335155 |
oct | 261647574012711 |
9 | 47236465834715 |
10 | 12220221101513 |
11 | 399162625a947 |
12 | 145443b3a3635 |
13 | 6a849214b589 |
14 | 30366749c065 |
15 | 162d21737478 |
hex | b1d3df015c9 |
12220221101513 has 2 divisors, whose sum is σ = 12220221101514. Its totient is φ = 12220221101512.
The previous prime is 12220221101479. The next prime is 12220221101563. The reversal of 12220221101513 is 31510112202221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10692690721024 + 1527530380489 = 3269968^2 + 1235933^2 .
It is a cyclic number.
It is not a de Polignac number, because 12220221101513 - 210 = 12220221100489 is a prime.
It is not a weakly prime, because it can be changed into another prime (12220221101563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6110110550756 + 6110110550757.
It is an arithmetic number, because the mean of its divisors is an integer number (6110110550757).
Almost surely, 212220221101513 is an apocalyptic number.
It is an amenable number.
12220221101513 is a deficient number, since it is larger than the sum of its proper divisors (1).
12220221101513 is an equidigital number, since it uses as much as digits as its factorization.
12220221101513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 23.
Adding to 12220221101513 its reverse (31510112202221), we get a palindrome (43730333303734).
The spelling of 12220221101513 in words is "twelve trillion, two hundred twenty billion, two hundred twenty-one million, one hundred one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •