Base | Representation |
---|---|
bin | 100111111100100110010… |
… | …100000001110101111101 |
3 | 100201102122121112121201002 |
4 | 213330212110001311331 |
5 | 324434004440334111 |
6 | 5501032140100045 |
7 | 402220542353126 |
oct | 47744624016575 |
9 | 10642577477632 |
10 | 2745126886781 |
11 | 969224620434 |
12 | 384035534625 |
13 | 16bb30caab86 |
14 | 96c1721304d |
15 | 4b618bd963b |
hex | 27f26501d7d |
2745126886781 has 2 divisors, whose sum is σ = 2745126886782. Its totient is φ = 2745126886780.
The previous prime is 2745126886763. The next prime is 2745126886787. The reversal of 2745126886781 is 1876886215472.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1492721932900 + 1252404953881 = 1221770^2 + 1119109^2 .
It is a cyclic number.
It is not a de Polignac number, because 2745126886781 - 234 = 2727947017597 is a prime.
It is a super-2 number, since 2×27451268867812 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2745126886787) 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, 1372563443390 + 1372563443391.
It is an arithmetic number, because the mean of its divisors is an integer number (1372563443391).
Almost surely, 22745126886781 is an apocalyptic number.
It is an amenable number.
2745126886781 is a deficient number, since it is larger than the sum of its proper divisors (1).
2745126886781 is an equidigital number, since it uses as much as digits as its factorization.
2745126886781 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 72253440, while the sum is 65.
The spelling of 2745126886781 in words is "two trillion, seven hundred forty-five billion, one hundred twenty-six million, eight hundred eighty-six thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •