Base | Representation |
---|---|
bin | 1011011000010111000100… |
… | …0111111010010101110001 |
3 | 1122022020121002001200222002 |
4 | 2312011301013322111301 |
5 | 3120003401213221000 |
6 | 42340242302223345 |
7 | 2431021133636660 |
oct | 266056107722561 |
9 | 48266532050862 |
10 | 12513137632625 |
11 | 3a94878a82123 |
12 | 14a1168584b55 |
13 | 6c9ca359ac76 |
14 | 3138d3956dd7 |
15 | 16a7670e08d5 |
hex | b61711fa571 |
12513137632625 has 16 divisors (see below), whose sum is σ = 17847309447552. Its totient is φ = 8580437233200.
The previous prime is 12513137632613. The next prime is 12513137632631. The reversal of 12513137632625 is 52623673131521.
It is not a de Polignac number, because 12513137632625 - 210 = 12513137631601 is a prime.
It is a super-2 number, since 2×125131376326252 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12513137632625.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7150363487 + ... + 7150365236.
It is an arithmetic number, because the mean of its divisors is an integer number (1115456840472).
Almost surely, 212513137632625 is an apocalyptic number.
It is an amenable number.
12513137632625 is a deficient number, since it is larger than the sum of its proper divisors (5334171814927).
12513137632625 is an equidigital number, since it uses as much as digits as its factorization.
12513137632625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14300728745 (or 14300728735 counting only the distinct ones).
The product of its digits is 1360800, while the sum is 47.
The spelling of 12513137632625 in words is "twelve trillion, five hundred thirteen billion, one hundred thirty-seven million, six hundred thirty-two thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •