Base | Representation |
---|---|
bin | 11000110100000000… |
… | …11011100001100001 |
3 | 1021101101020012112112 |
4 | 30122000123201201 |
5 | 204240213102431 |
6 | 10041504005105 |
7 | 651053343425 |
oct | 143200334141 |
9 | 37341205475 |
10 | 13321222241 |
11 | 5716534488 |
12 | 26b9300795 |
13 | 1343ac0332 |
14 | 9052a4b85 |
15 | 52e753c2b |
hex | 31a01b861 |
13321222241 has 2 divisors, whose sum is σ = 13321222242. Its totient is φ = 13321222240.
The previous prime is 13321222223. The next prime is 13321222283. The reversal of 13321222241 is 14222212331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10609000000 + 2712222241 = 103000^2 + 52079^2 .
It is an emirp because it is prime and its reverse (14222212331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13321222241 - 210 = 13321221217 is a prime.
It is a super-2 number, since 2×133212222412 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13321222141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6660611120 + 6660611121.
It is an arithmetic number, because the mean of its divisors is an integer number (6660611121).
Almost surely, 213321222241 is an apocalyptic number.
It is an amenable number.
13321222241 is a deficient number, since it is larger than the sum of its proper divisors (1).
13321222241 is an equidigital number, since it uses as much as digits as its factorization.
13321222241 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1152, while the sum is 23.
Adding to 13321222241 its reverse (14222212331), we get a palindrome (27543434572).
The spelling of 13321222241 in words is "thirteen billion, three hundred twenty-one million, two hundred twenty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •