Base | Representation |
---|---|
bin | 11001100000101100… |
… | …10010010100011101 |
3 | 1022100111112110012012 |
4 | 30300112102110131 |
5 | 211022142103321 |
6 | 10143013521005 |
7 | 663254336162 |
oct | 146026222435 |
9 | 38314473165 |
10 | 13696050461 |
11 | 5899077475 |
12 | 27a2943165 |
13 | 13a365a492 |
14 | 93cd96069 |
15 | 5525e405b |
hex | 33059251d |
13696050461 has 2 divisors, whose sum is σ = 13696050462. Its totient is φ = 13696050460.
The previous prime is 13696050439. The next prime is 13696050469. The reversal of 13696050461 is 16405069631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7339177561 + 6356872900 = 85669^2 + 79730^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13696050461 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13696050469) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6848025230 + 6848025231.
It is an arithmetic number, because the mean of its divisors is an integer number (6848025231).
Almost surely, 213696050461 is an apocalyptic number.
It is an amenable number.
13696050461 is a deficient number, since it is larger than the sum of its proper divisors (1).
13696050461 is an equidigital number, since it uses as much as digits as its factorization.
13696050461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 116640, while the sum is 41.
The spelling of 13696050461 in words is "thirteen billion, six hundred ninety-six million, fifty thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •