Base | Representation |
---|---|
bin | 1100011101110000011000… |
… | …1101100010100101001111 |
3 | 1210112012220001021122210222 |
4 | 3013130012031202211033 |
5 | 3244022021240314401 |
6 | 45052052024421555 |
7 | 2613115136055563 |
oct | 307340615424517 |
9 | 53465801248728 |
10 | 13705344854351 |
11 | 4404449966597 |
12 | 16542303178bb |
13 | 785540557c67 |
14 | 3554b11196a3 |
15 | 18b792ab4c1b |
hex | c770636294f |
13705344854351 has 2 divisors, whose sum is σ = 13705344854352. Its totient is φ = 13705344854350.
The previous prime is 13705344854291. The next prime is 13705344854353. The reversal of 13705344854351 is 15345844350731.
13705344854351 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13705344854351 - 26 = 13705344854287 is a prime.
Together with 13705344854353, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 13705344854293 and 13705344854302.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13705344854353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6852672427175 + 6852672427176.
It is an arithmetic number, because the mean of its divisors is an integer number (6852672427176).
Almost surely, 213705344854351 is an apocalyptic number.
13705344854351 is a deficient number, since it is larger than the sum of its proper divisors (1).
13705344854351 is an equidigital number, since it uses as much as digits as its factorization.
13705344854351 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12096000, while the sum is 53.
The spelling of 13705344854351 in words is "thirteen trillion, seven hundred five billion, three hundred forty-four million, eight hundred fifty-four thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •