Base | Representation |
---|---|
bin | 1011101100001001010011… |
… | …1101010110101100001101 |
3 | 1200111201221112201002122021 |
4 | 2323002110331112230031 |
5 | 3141041012030330300 |
6 | 43200334452450141 |
7 | 2464413226053256 |
oct | 273022475265415 |
9 | 50451845632567 |
10 | 12853041261325 |
11 | 4105a42794261 |
12 | 1537009619951 |
13 | 723062509195 |
14 | 32613a53bb2d |
15 | 17450ca9bd1a |
hex | bb094f56b0d |
12853041261325 has 12 divisors (see below), whose sum is σ = 15937815623220. Its totient is φ = 10282404325760.
The previous prime is 12853041261323. The next prime is 12853041261337. The reversal of 12853041261325 is 52316214035821.
It can be written as a sum of positive squares in 6 ways, for example, as 3722503325641 + 9130537935684 = 1929379^2 + 3021678^2 .
It is not a de Polignac number, because 12853041261325 - 21 = 12853041261323 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12853041261323) by changing a digit.
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, 17331537 + ... + 18057913.
It is an arithmetic number, because the mean of its divisors is an integer number (1328151301935).
Almost surely, 212853041261325 is an apocalyptic number.
It is an amenable number.
12853041261325 is a deficient number, since it is larger than the sum of its proper divisors (3084774361895).
12853041261325 is an equidigital number, since it uses as much as digits as its factorization.
12853041261325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1434176 (or 1434171 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 43.
The spelling of 12853041261325 in words is "twelve trillion, eight hundred fifty-three billion, forty-one million, two hundred sixty-one thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •