Base | Representation |
---|---|
bin | 1100000101000100111110… |
… | …0111101010111000101101 |
3 | 1202000200112211121012021002 |
4 | 3001101033213222320231 |
5 | 3220100223404203243 |
6 | 44125213532250045 |
7 | 2540355563041301 |
oct | 301211747527055 |
9 | 52020484535232 |
10 | 13281374678573 |
11 | 4260665841371 |
12 | 15a6029610925 |
13 | 754574b63571 |
14 | 33cb71681d01 |
15 | 18072bb1beb8 |
hex | c144f9eae2d |
13281374678573 has 2 divisors, whose sum is σ = 13281374678574. Its totient is φ = 13281374678572.
The previous prime is 13281374678569. The next prime is 13281374678603. The reversal of 13281374678573 is 37587647318231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10915444645609 + 2365930032964 = 3303853^2 + 1538158^2 .
It is a cyclic number.
It is not a de Polignac number, because 13281374678573 - 22 = 13281374678569 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 (13281374608573) 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, 6640687339286 + 6640687339287.
It is an arithmetic number, because the mean of its divisors is an integer number (6640687339287).
Almost surely, 213281374678573 is an apocalyptic number.
It is an amenable number.
13281374678573 is a deficient number, since it is larger than the sum of its proper divisors (1).
13281374678573 is an equidigital number, since it uses as much as digits as its factorization.
13281374678573 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 142248960, while the sum is 65.
The spelling of 13281374678573 in words is "thirteen trillion, two hundred eighty-one billion, three hundred seventy-four million, six hundred seventy-eight thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •