Base | Representation |
---|---|
bin | 1100001111111100101110… |
… | …1011111001000100000001 |
3 | 1202200112121211001000222212 |
4 | 3003333023223321010001 |
5 | 3231130222234104404 |
6 | 44351102240111505 |
7 | 2560020026013503 |
oct | 303771353710401 |
9 | 52615554030885 |
10 | 13468139753729 |
11 | 4322895860651 |
12 | 1616270905595 |
13 | 76906a218c5b |
14 | 347c0bb23d73 |
15 | 18550d1d706e |
hex | c3fcbaf9101 |
13468139753729 has 2 divisors, whose sum is σ = 13468139753730. Its totient is φ = 13468139753728.
The previous prime is 13468139753723. The next prime is 13468139753779. The reversal of 13468139753729 is 92735793186431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7829794523329 + 5638345230400 = 2798177^2 + 2374520^2 .
It is an emirp because it is prime and its reverse (92735793186431) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13468139753729 is a prime.
It is not a weakly prime, because it can be changed into another prime (13468139753723) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6734069876864 + 6734069876865.
It is an arithmetic number, because the mean of its divisors is an integer number (6734069876865).
Almost surely, 213468139753729 is an apocalyptic number.
It is an amenable number.
13468139753729 is a deficient number, since it is larger than the sum of its proper divisors (1).
13468139753729 is an equidigital number, since it uses as much as digits as its factorization.
13468139753729 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 205752960, while the sum is 68.
The spelling of 13468139753729 in words is "thirteen trillion, four hundred sixty-eight billion, one hundred thirty-nine million, seven hundred fifty-three thousand, seven hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •