Base | Representation |
---|---|
bin | 1011100101011110000101… |
… | …1111000101011000011111 |
3 | 1200002202221021122222210222 |
4 | 2321113201133011120133 |
5 | 3132201130412223001 |
6 | 43031531113551555 |
7 | 2453213314303553 |
oct | 271274137053037 |
9 | 50082837588728 |
10 | 12738361054751 |
11 | 40713437aa732 |
12 | 15189434155bb |
13 | 7152b74bb897 |
14 | 32077b93d863 |
15 | 171549b6b61b |
hex | b95e17c561f |
12738361054751 has 4 divisors (see below), whose sum is σ = 12740202663672. Its totient is φ = 12736519445832.
The previous prime is 12738361054739. The next prime is 12738361054777. The reversal of 12738361054751 is 15745016383721.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12738361054751 - 226 = 12738293945887 is a prime.
It is a super-2 number, since 2×127383610547512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12738361054693 and 12738361054702.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12738361054051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 920794085 + ... + 920807918.
It is an arithmetic number, because the mean of its divisors is an integer number (3185050665918).
Almost surely, 212738361054751 is an apocalyptic number.
12738361054751 is a deficient number, since it is larger than the sum of its proper divisors (1841608921).
12738361054751 is an equidigital number, since it uses as much as digits as its factorization.
12738361054751 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1841608920.
The product of its (nonzero) digits is 4233600, while the sum is 53.
The spelling of 12738361054751 in words is "twelve trillion, seven hundred thirty-eight billion, three hundred sixty-one million, fifty-four thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •