Base | Representation |
---|---|
bin | 100000001011011100111… |
… | …101010010100110000101 |
3 | 21211101210201011112201111 |
4 | 200023130331102212011 |
5 | 242212240440311423 |
6 | 4411511055125021 |
7 | 315522401642464 |
oct | 40133475224605 |
9 | 7741721145644 |
10 | 2211320244613 |
11 | 7828a76a1347 |
12 | 2b869a813771 |
13 | 1306acc4652c |
14 | 790581a49db |
15 | 3c7c519d60d |
hex | 202dcf52985 |
2211320244613 has 2 divisors, whose sum is σ = 2211320244614. Its totient is φ = 2211320244612.
The previous prime is 2211320244593. The next prime is 2211320244619. The reversal of 2211320244613 is 3164420231122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1557449088484 + 653871156129 = 1247978^2 + 808623^2 .
It is a cyclic number.
It is not a de Polignac number, because 2211320244613 - 225 = 2211286690181 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2211320244619) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1105660122306 + 1105660122307.
It is an arithmetic number, because the mean of its divisors is an integer number (1105660122307).
Almost surely, 22211320244613 is an apocalyptic number.
It is an amenable number.
2211320244613 is a deficient number, since it is larger than the sum of its proper divisors (1).
2211320244613 is an equidigital number, since it uses as much as digits as its factorization.
2211320244613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 2211320244613 its reverse (3164420231122), we get a palindrome (5375740475735).
The spelling of 2211320244613 in words is "two trillion, two hundred eleven billion, three hundred twenty million, two hundred forty-four thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •