Base | Representation |
---|---|
bin | 1011101001110101110000… |
… | …0111001110000110110001 |
3 | 1200100221201011110211221211 |
4 | 2322131130013032012301 |
5 | 3134413402301400000 |
6 | 43130224302520121 |
7 | 2461511545043134 |
oct | 272353407160661 |
9 | 50327634424854 |
10 | 12813432840625 |
11 | 40a016787a57a |
12 | 152b3b4896041 |
13 | 71c3bc60a461 |
14 | 32425dd8221b |
15 | 1734906637ba |
hex | ba75c1ce1b1 |
12813432840625 has 12 divisors (see below), whose sum is σ = 16015765980060. Its totient is φ = 10250746270000.
The previous prime is 12813432840553. The next prime is 12813432840647. The reversal of 12813432840625 is 52604823431821.
It can be written as a sum of positive squares in 6 ways, for example, as 12634107693601 + 179325147024 = 3554449^2 + 423468^2 .
It is not a de Polignac number, because 12813432840625 - 227 = 12813298622897 is a prime.
It is a super-2 number, since 2×128134328406252 (a number of 27 digits) contains 22 as substring.
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 11 ways as a sum of consecutive naturals, for example, 2050146130 + ... + 2050152379.
It is an arithmetic number, because the mean of its divisors is an integer number (1334647165005).
Almost surely, 212813432840625 is an apocalyptic number.
It is an amenable number.
12813432840625 is a deficient number, since it is larger than the sum of its proper divisors (3202333139435).
12813432840625 is an frugal number, since it uses more digits than its factorization.
12813432840625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4100298534 (or 4100298514 counting only the distinct ones).
The product of its (nonzero) digits is 2211840, while the sum is 49.
The spelling of 12813432840625 in words is "twelve trillion, eight hundred thirteen billion, four hundred thirty-two million, eight hundred forty thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •