Base | Representation |
---|---|
bin | 10111100001110110… |
… | …10011010101011101 |
3 | 1012121100100200222221 |
4 | 23300323103111131 |
5 | 201332243342000 |
6 | 5445243505341 |
7 | 625014221455 |
oct | 136073232535 |
9 | 35540320887 |
10 | 12632012125 |
11 | 53a2494747 |
12 | 2546528251 |
13 | 126408b1b5 |
14 | 87b938d65 |
15 | 4ddeb361a |
hex | 2f0ed355d |
12632012125 has 32 divisors (see below), whose sum is σ = 16380655200. Its totient is φ = 9713894400.
The previous prime is 12632012039. The next prime is 12632012143. The reversal of 12632012125 is 52121023621.
It can be written as a sum of positive squares in 16 ways, for example, as 3217385284 + 9414626841 = 56722^2 + 97029^2 .
It is not a de Polignac number, because 12632012125 - 219 = 12631487837 is a prime.
It is a super-2 number, since 2×126320121252 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a self number, because there is not a number n which added to its sum of digits gives 12632012125.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 822517 + ... + 837733.
It is an arithmetic number, because the mean of its divisors is an integer number (511895475).
Almost surely, 212632012125 is an apocalyptic number.
It is an amenable number.
12632012125 is a deficient number, since it is larger than the sum of its proper divisors (3748643075).
12632012125 is a wasteful number, since it uses less digits than its factorization.
12632012125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15490 (or 15480 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 12632012125 its reverse (52121023621), we get a palindrome (64753035746).
The spelling of 12632012125 in words is "twelve billion, six hundred thirty-two million, twelve thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •