Base | Representation |
---|---|
bin | 10111101111000111… |
… | …01110000101010001 |
3 | 1012220002201020010021 |
4 | 23313203232011101 |
5 | 202044234130422 |
6 | 5504300303441 |
7 | 630535004551 |
oct | 136743560521 |
9 | 35802636107 |
10 | 12743270737 |
11 | 544a275a0a |
12 | 2577841b81 |
13 | 12811443b2 |
14 | 88c61b161 |
15 | 4e8b3ddc7 |
hex | 2f78ee151 |
12743270737 has 8 divisors (see below), whose sum is σ = 13496966496. Its totient is φ = 11990029632.
The previous prime is 12743270731. The next prime is 12743270747. The reversal of 12743270737 is 73707234721.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12743270737 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12743270693 and 12743270702.
It is not an unprimeable number, because it can be changed into a prime (12743270731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55083 + ... + 168880.
It is an arithmetic number, because the mean of its divisors is an integer number (1687120812).
Almost surely, 212743270737 is an apocalyptic number.
12743270737 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
12743270737 is a deficient number, since it is larger than the sum of its proper divisors (753695759).
12743270737 is a wasteful number, since it uses less digits than its factorization.
12743270737 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227327.
The product of its (nonzero) digits is 345744, while the sum is 43.
The spelling of 12743270737 in words is "twelve billion, seven hundred forty-three million, two hundred seventy thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •