Base | Representation |
---|---|
bin | 1011111101000011000011… |
… | …1000100001111101001101 |
3 | 1201112111110112122000101111 |
4 | 2333100300320201331031 |
5 | 3210320211013120102 |
6 | 43542000454012021 |
7 | 2524403126046565 |
oct | 277206070417515 |
9 | 51474415560344 |
10 | 13143420051277 |
11 | 4208102a74a9a |
12 | 1583348947011 |
13 | 74455ac73a99 |
14 | 33620595dda5 |
15 | 17bd55771cd7 |
hex | bf430e21f4d |
13143420051277 has 2 divisors, whose sum is σ = 13143420051278. Its totient is φ = 13143420051276.
The previous prime is 13143420051247. The next prime is 13143420051299. The reversal of 13143420051277 is 77215002434131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6991973446756 + 6151446604521 = 2644234^2 + 2480211^2 .
It is an emirp because it is prime and its reverse (77215002434131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13143420051277 - 223 = 13143411662669 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13143420051247) 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, 6571710025638 + 6571710025639.
It is an arithmetic number, because the mean of its divisors is an integer number (6571710025639).
Almost surely, 213143420051277 is an apocalyptic number.
It is an amenable number.
13143420051277 is a deficient number, since it is larger than the sum of its proper divisors (1).
13143420051277 is an equidigital number, since it uses as much as digits as its factorization.
13143420051277 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 141120, while the sum is 40.
The spelling of 13143420051277 in words is "thirteen trillion, one hundred forty-three billion, four hundred twenty million, fifty-one thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •