Base | Representation |
---|---|
bin | 1100000010011001001100… |
… | …1111001001111101111001 |
3 | 1201212021112100002112100111 |
4 | 3000212103033021331321 |
5 | 3213321310200301323 |
6 | 44052110242304321 |
7 | 2534134122501136 |
oct | 300462317117571 |
9 | 51767470075314 |
10 | 13235264462713 |
11 | 4243053823757 |
12 | 15990bb3580a1 |
13 | 750106c35877 |
14 | 33a8397b558d |
15 | 17e42d9cac0d |
hex | c09933c9f79 |
13235264462713 has 2 divisors, whose sum is σ = 13235264462714. Its totient is φ = 13235264462712.
The previous prime is 13235264462669. The next prime is 13235264462723. The reversal of 13235264462713 is 31726446253231.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12861884804409 + 373379658304 = 3586347^2 + 611048^2 .
It is an emirp because it is prime and its reverse (31726446253231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13235264462713 - 29 = 13235264462201 is a prime.
It is not a weakly prime, because it can be changed into another prime (13235264462723) 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, 6617632231356 + 6617632231357.
It is an arithmetic number, because the mean of its divisors is an integer number (6617632231357).
Almost surely, 213235264462713 is an apocalyptic number.
It is an amenable number.
13235264462713 is a deficient number, since it is larger than the sum of its proper divisors (1).
13235264462713 is an equidigital number, since it uses as much as digits as its factorization.
13235264462713 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4354560, while the sum is 49.
The spelling of 13235264462713 in words is "thirteen trillion, two hundred thirty-five billion, two hundred sixty-four million, four hundred sixty-two thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •