Base | Representation |
---|---|
bin | 11000100111111110… |
… | …00100000001011101 |
3 | 1021010100010202211002 |
4 | 30103333010001131 |
5 | 204033332404131 |
6 | 10023454440045 |
7 | 645415564502 |
oct | 142377040135 |
9 | 37110122732 |
10 | 13220200541 |
11 | 5674505379 |
12 | 268b503025 |
13 | 1328bac792 |
14 | 8d5ac94a9 |
15 | 52594b6cb |
hex | 313fc405d |
13220200541 has 2 divisors, whose sum is σ = 13220200542. Its totient is φ = 13220200540.
The previous prime is 13220200517. The next prime is 13220200559. The reversal of 13220200541 is 14500202231.
13220200541 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., 8894376100 + 4325824441 = 94310^2 + 65771^2 .
It is a cyclic number.
It is not a de Polignac number, because 13220200541 - 214 = 13220184157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13220206541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6610100270 + 6610100271.
It is an arithmetic number, because the mean of its divisors is an integer number (6610100271).
Almost surely, 213220200541 is an apocalyptic number.
It is an amenable number.
13220200541 is a deficient number, since it is larger than the sum of its proper divisors (1).
13220200541 is an equidigital number, since it uses as much as digits as its factorization.
13220200541 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 20.
Adding to 13220200541 its reverse (14500202231), we get a palindrome (27720402772).
The spelling of 13220200541 in words is "thirteen billion, two hundred twenty million, two hundred thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •