Base | Representation |
---|---|
bin | 10111100001110101… |
… | …10001111000110101 |
3 | 1012121100002202001212 |
4 | 23300322301320311 |
5 | 201332230001000 |
6 | 5445240531205 |
7 | 625013111162 |
oct | 136072617065 |
9 | 35540082055 |
10 | 12631875125 |
11 | 53a2400821 |
12 | 2546480b05 |
13 | 1264040a2c |
14 | 87b901069 |
15 | 4dde87c35 |
hex | 2f0eb1e35 |
12631875125 has 8 divisors (see below), whose sum is σ = 15764580312. Its totient is φ = 10105500000.
The previous prime is 12631875119. The next prime is 12631875131. The reversal of 12631875125 is 52157813621.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (12631875119) and next prime (12631875131).
It can be written as a sum of positive squares in 4 ways, for example, as 328406884 + 12303468241 = 18122^2 + 110921^2 .
It is a de Polignac number, because none of the positive numbers 2k-12631875125 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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, 50527376 + ... + 50527625.
It is an arithmetic number, because the mean of its divisors is an integer number (1970572539).
Almost surely, 212631875125 is an apocalyptic number.
It is an amenable number.
12631875125 is a deficient number, since it is larger than the sum of its proper divisors (3132705187).
12631875125 is an equidigital number, since it uses as much as digits as its factorization.
12631875125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101055016 (or 101055006 counting only the distinct ones).
The product of its digits is 100800, while the sum is 41.
The spelling of 12631875125 in words is "twelve billion, six hundred thirty-one million, eight hundred seventy-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •