Base | Representation |
---|---|
bin | 100000010100101111110… |
… | …100010110011001011101 |
3 | 21212100120020111010220102 |
4 | 200110233310112121131 |
5 | 242343210342010123 |
6 | 4420241251230445 |
7 | 316324615252403 |
oct | 40245764263135 |
9 | 7770506433812 |
10 | 2221300344413 |
11 | 787059154007 |
12 | 2ba604ba8425 |
13 | 131610786b27 |
14 | 79723827473 |
15 | 3cbab42a028 |
hex | 2052fd1665d |
2221300344413 has 2 divisors, whose sum is σ = 2221300344414. Its totient is φ = 2221300344412.
The previous prime is 2221300344359. The next prime is 2221300344463. The reversal of 2221300344413 is 3144430031222.
2221300344413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1694482768729 + 526817575684 = 1301723^2 + 725822^2 .
It is a cyclic number.
It is not a de Polignac number, because 2221300344413 - 210 = 2221300343389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2221300344463) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1110650172206 + 1110650172207.
It is an arithmetic number, because the mean of its divisors is an integer number (1110650172207).
Almost surely, 22221300344413 is an apocalyptic number.
It is an amenable number.
2221300344413 is a deficient number, since it is larger than the sum of its proper divisors (1).
2221300344413 is an equidigital number, since it uses as much as digits as its factorization.
2221300344413 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 29.
Adding to 2221300344413 its reverse (3144430031222), we get a palindrome (5365730375635).
The spelling of 2221300344413 in words is "two trillion, two hundred twenty-one billion, three hundred million, three hundred forty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •