Base | Representation |
---|---|
bin | 1011111100000110111110… |
… | …1011100011100010000001 |
3 | 1201110221211200010210100001 |
4 | 2333001233223203202001 |
5 | 3210034144144322111 |
6 | 43530332343200001 |
7 | 2523262401522322 |
oct | 277015753434201 |
9 | 51427750123301 |
10 | 13127293745281 |
11 | 4201288100681 |
12 | 15801a8146001 |
13 | 742b8ac965a1 |
14 | 335515d10449 |
15 | 17b70eb2c1c1 |
hex | bf06fae3881 |
13127293745281 has 2 divisors, whose sum is σ = 13127293745282. Its totient is φ = 13127293745280.
The previous prime is 13127293745243. The next prime is 13127293745297. The reversal of 13127293745281 is 18254739272131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11828206694656 + 1299087050625 = 3439216^2 + 1139775^2 .
It is a cyclic number.
It is not a de Polignac number, because 13127293745281 - 211 = 13127293743233 is a prime.
It is a super-2 number, since 2×131272937452812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13127293745221) 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, 6563646872640 + 6563646872641.
It is an arithmetic number, because the mean of its divisors is an integer number (6563646872641).
Almost surely, 213127293745281 is an apocalyptic number.
It is an amenable number.
13127293745281 is a deficient number, since it is larger than the sum of its proper divisors (1).
13127293745281 is an equidigital number, since it uses as much as digits as its factorization.
13127293745281 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5080320, while the sum is 55.
The spelling of 13127293745281 in words is "thirteen trillion, one hundred twenty-seven billion, two hundred ninety-three million, seven hundred forty-five thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •