Base | Representation |
---|---|
bin | 1101001100101111110000… |
… | …0001001101000110011101 |
3 | 1220101101121222101022001021 |
4 | 3103023330001031012131 |
5 | 3400233330142401000 |
6 | 50511001545444141 |
7 | 3025334305042252 |
oct | 323137401150635 |
9 | 56341558338037 |
10 | 14512627700125 |
11 | 4695852aa2095 |
12 | 17647897a0651 |
13 | 8136c52b0319 |
14 | 3825b47c7429 |
15 | 1a279044211a |
hex | d32fc04d19d |
14512627700125 has 8 divisors (see below), whose sum is σ = 18111759369912. Its totient is φ = 11610102160000.
The previous prime is 14512627700093. The next prime is 14512627700141. The reversal of 14512627700125 is 52100772621541.
14512627700125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 44486402724 + 14468141297401 = 210918^2 + 3803701^2 .
It is not a de Polignac number, because 14512627700125 - 25 = 14512627700093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 58050510676 + ... + 58050510925.
It is an arithmetic number, because the mean of its divisors is an integer number (2263969921239).
Almost surely, 214512627700125 is an apocalyptic number.
It is an amenable number.
14512627700125 is a deficient number, since it is larger than the sum of its proper divisors (3599131669787).
14512627700125 is an equidigital number, since it uses as much as digits as its factorization.
14512627700125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116101021616 (or 116101021606 counting only the distinct ones).
The product of its (nonzero) digits is 235200, while the sum is 43.
The spelling of 14512627700125 in words is "fourteen trillion, five hundred twelve billion, six hundred twenty-seven million, seven hundred thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.443 sec. • engine limits •