Base | Representation |
---|---|
bin | 11001100000111001… |
… | …00100000011101101 |
3 | 1022100121122001102101 |
4 | 30300130210003231 |
5 | 211023102232411 |
6 | 10143113055101 |
7 | 663304331464 |
oct | 146034440355 |
9 | 38317561371 |
10 | 13697695981 |
11 | 5899aa0802 |
12 | 27a33b7491 |
13 | 13a3ab5468 |
14 | 93d2a39db |
15 | 55281b8c1 |
hex | 3307240ed |
13697695981 has 2 divisors, whose sum is σ = 13697695982. Its totient is φ = 13697695980.
The previous prime is 13697695943. The next prime is 13697695997. The reversal of 13697695981 is 18959679631.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13395979081 + 301716900 = 115741^2 + 17370^2 .
It is a cyclic number.
It is not a de Polignac number, because 13697695981 - 27 = 13697695853 is a prime.
It is a super-2 number, since 2×136976959812 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13697695901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6848847990 + 6848847991.
It is an arithmetic number, because the mean of its divisors is an integer number (6848847991).
Almost surely, 213697695981 is an apocalyptic number.
It is an amenable number.
13697695981 is a deficient number, since it is larger than the sum of its proper divisors (1).
13697695981 is an equidigital number, since it uses as much as digits as its factorization.
13697695981 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 22044960, while the sum is 64.
The spelling of 13697695981 in words is "thirteen billion, six hundred ninety-seven million, six hundred ninety-five thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •