Base | Representation |
---|---|
bin | 1011011111101011011010… |
… | …1010011000001001100101 |
3 | 1122202021002202202201102202 |
4 | 2313322312222120021211 |
5 | 3124033340214101414 |
6 | 42514113353344245 |
7 | 2443061456244161 |
oct | 267726652301145 |
9 | 48667082681382 |
10 | 12638858347109 |
11 | 4033123051755 |
12 | 15015b4108085 |
13 | 708abaa26997 |
14 | 319a1c96bca1 |
15 | 16db744129de |
hex | b7eb6a98265 |
12638858347109 has 2 divisors, whose sum is σ = 12638858347110. Its totient is φ = 12638858347108.
The previous prime is 12638858347103. The next prime is 12638858347111. The reversal of 12638858347109 is 90174385883621.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11977808044609 + 661050302500 = 3460897^2 + 813050^2 .
It is a cyclic number.
It is not a de Polignac number, because 12638858347109 - 216 = 12638858281573 is a prime.
Together with 12638858347111, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12638858347103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6319429173554 + 6319429173555.
It is an arithmetic number, because the mean of its divisors is an integer number (6319429173555).
It is a 1-persistent number, because it is pandigital, but 2⋅12638858347109 = 25277716694218 is not.
Almost surely, 212638858347109 is an apocalyptic number.
It is an amenable number.
12638858347109 is a deficient number, since it is larger than the sum of its proper divisors (1).
12638858347109 is an equidigital number, since it uses as much as digits as its factorization.
12638858347109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 69672960, while the sum is 65.
The spelling of 12638858347109 in words is "twelve trillion, six hundred thirty-eight billion, eight hundred fifty-eight million, three hundred forty-seven thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •