Base | Representation |
---|---|
bin | 11001100000001001… |
… | …11011100101110001 |
3 | 1022100011222022101102 |
4 | 30300010323211301 |
5 | 211020011012123 |
6 | 10142332214145 |
7 | 663200560166 |
oct | 146004734561 |
9 | 38304868342 |
10 | 13691500913 |
11 | 589654a312 |
12 | 27a130a355 |
13 | 13a272673c |
14 | 93c53006d |
15 | 551ee6028 |
hex | 33013b971 |
13691500913 has 2 divisors, whose sum is σ = 13691500914. Its totient is φ = 13691500912.
The previous prime is 13691500873. The next prime is 13691500943. The reversal of 13691500913 is 31900519631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13690872064 + 628849 = 117008^2 + 793^2 .
It is a cyclic number.
It is not a de Polignac number, because 13691500913 - 212 = 13691496817 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (13691500943) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6845750456 + 6845750457.
It is an arithmetic number, because the mean of its divisors is an integer number (6845750457).
Almost surely, 213691500913 is an apocalyptic number.
It is an amenable number.
13691500913 is a deficient number, since it is larger than the sum of its proper divisors (1).
13691500913 is an equidigital number, since it uses as much as digits as its factorization.
13691500913 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 21870, while the sum is 38.
The spelling of 13691500913 in words is "thirteen billion, six hundred ninety-one million, five hundred thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.193 sec. • engine limits •