Base | Representation |
---|---|
bin | 11000100101101100… |
… | …11110100110111001 |
3 | 1021002000100001211102 |
4 | 30102312132212321 |
5 | 204014000013141 |
6 | 10021534541145 |
7 | 645065055416 |
oct | 142266364671 |
9 | 37060301742 |
10 | 13201172921 |
11 | 5664799672 |
12 | 26850677b5 |
13 | 1324c79b31 |
14 | 8d337510d |
15 | 523e3d99b |
hex | 312d9e9b9 |
13201172921 has 2 divisors, whose sum is σ = 13201172922. Its totient is φ = 13201172920.
The previous prime is 13201172899. The next prime is 13201172927. The reversal of 13201172921 is 12927110231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11134470400 + 2066702521 = 105520^2 + 45461^2 .
It is a cyclic number.
It is not a de Polignac number, because 13201172921 - 26 = 13201172857 is a prime.
It is not a weakly prime, because it can be changed into another prime (13201172927) 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, 6600586460 + 6600586461.
It is an arithmetic number, because the mean of its divisors is an integer number (6600586461).
Almost surely, 213201172921 is an apocalyptic number.
It is an amenable number.
13201172921 is a deficient number, since it is larger than the sum of its proper divisors (1).
13201172921 is an equidigital number, since it uses as much as digits as its factorization.
13201172921 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 29.
The spelling of 13201172921 in words is "thirteen billion, two hundred one million, one hundred seventy-two thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •