Base | Representation |
---|---|
bin | 11001001000110100… |
… | …00010100001000001 |
3 | 1021211112112222121102 |
4 | 30210122002201001 |
5 | 210114400121323 |
6 | 10111055504145 |
7 | 655302423425 |
oct | 144432024101 |
9 | 37745488542 |
10 | 13495707713 |
11 | 57a5a7aa54 |
12 | 2747828055 |
13 | 1370cb3187 |
14 | 920524b85 |
15 | 53ec1d328 |
hex | 324682841 |
13495707713 has 2 divisors, whose sum is σ = 13495707714. Its totient is φ = 13495707712.
The previous prime is 13495707671. The next prime is 13495707721. The reversal of 13495707713 is 31770759431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11095883569 + 2399824144 = 105337^2 + 48988^2 .
It is a cyclic number.
It is not a de Polignac number, because 13495707713 - 216 = 13495642177 is a prime.
It is not a weakly prime, because it can be changed into another prime (13495707013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6747853856 + 6747853857.
It is an arithmetic number, because the mean of its divisors is an integer number (6747853857).
Almost surely, 213495707713 is an apocalyptic number.
It is an amenable number.
13495707713 is a deficient number, since it is larger than the sum of its proper divisors (1).
13495707713 is an equidigital number, since it uses as much as digits as its factorization.
13495707713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 555660, while the sum is 47.
The spelling of 13495707713 in words is "thirteen billion, four hundred ninety-five million, seven hundred seven thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •