Base | Representation |
---|---|
bin | 110011010000… |
… | …010100111101 |
3 | 221021122000211 |
4 | 303100110331 |
5 | 11414424341 |
6 | 1155552421 |
7 | 222130441 |
oct | 63202475 |
9 | 27248024 |
10 | 13436221 |
11 | 7647917 |
12 | 45bb711 |
13 | 2a25936 |
14 | 1ada821 |
15 | 12a6181 |
hex | cd053d |
13436221 has 2 divisors, whose sum is σ = 13436222. Its totient is φ = 13436220.
The previous prime is 13436207. The next prime is 13436263. The reversal of 13436221 is 12263431.
13436221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13039321 + 396900 = 3611^2 + 630^2 .
It is an emirp because it is prime and its reverse (12263431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13436221 - 211 = 13434173 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 13436192 and 13436201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13436921) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6718110 + 6718111.
It is an arithmetic number, because the mean of its divisors is an integer number (6718111).
Almost surely, 213436221 is an apocalyptic number.
It is an amenable number.
13436221 is a deficient number, since it is larger than the sum of its proper divisors (1).
13436221 is an equidigital number, since it uses as much as digits as its factorization.
13436221 is an evil number, because the sum of its binary digits is even.
The product of its digits is 864, while the sum is 22.
The square root of 13436221 is about 3665.5451163504. The cubic root of 13436221 is about 237.7345922111.
Adding to 13436221 its reverse (12263431), we get a palindrome (25699652).
The spelling of 13436221 in words is "thirteen million, four hundred thirty-six thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.002 sec. • engine limits •