Base | Representation |
---|---|
bin | 11000111001110101… |
… | …00011101110010101 |
3 | 1021111210001010002102 |
4 | 30130322203232111 |
5 | 204340210431423 |
6 | 10050405451445 |
7 | 652215151304 |
oct | 143472435625 |
9 | 37453033072 |
10 | 13370014613 |
11 | 574102a95a |
12 | 2711710b85 |
13 | 1350c44b67 |
14 | 90b96643b |
15 | 533b90c28 |
hex | 31cea3b95 |
13370014613 has 2 divisors, whose sum is σ = 13370014614. Its totient is φ = 13370014612.
The previous prime is 13370014561. The next prime is 13370014627. The reversal of 13370014613 is 31641007331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13110708004 + 259306609 = 114502^2 + 16103^2 .
It is a cyclic number.
It is not a de Polignac number, because 13370014613 - 210 = 13370013589 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13370014643) 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, 6685007306 + 6685007307.
It is an arithmetic number, because the mean of its divisors is an integer number (6685007307).
Almost surely, 213370014613 is an apocalyptic number.
It is an amenable number.
13370014613 is a deficient number, since it is larger than the sum of its proper divisors (1).
13370014613 is an equidigital number, since it uses as much as digits as its factorization.
13370014613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 29.
The spelling of 13370014613 in words is "thirteen billion, three hundred seventy million, fourteen thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •