Base | Representation |
---|---|
bin | 11000101100010011… |
… | …10001111001100101 |
3 | 1021012212120020112220 |
4 | 30112021301321211 |
5 | 204122140024300 |
6 | 10031234102553 |
7 | 646336636404 |
oct | 142611617145 |
9 | 37185506486 |
10 | 13256564325 |
11 | 5692a91a94 |
12 | 269b71aa59 |
13 | 13335a2204 |
14 | 8da87363b |
15 | 528c30da0 |
hex | 316271e65 |
13256564325 has 24 divisors (see below), whose sum is σ = 21980364000. Its totient is φ = 7049895360.
The previous prime is 13256564311. The next prime is 13256564327. The reversal of 13256564325 is 52346565231.
It is a happy number.
13256564325 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13256564325 - 29 = 13256563813 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13256564327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 227055 + ... + 279404.
It is an arithmetic number, because the mean of its divisors is an integer number (915848500).
Almost surely, 213256564325 is an apocalyptic number.
13256564325 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13256564325 is a deficient number, since it is larger than the sum of its proper divisors (8723799675).
13256564325 is a wasteful number, since it uses less digits than its factorization.
13256564325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 506821 (or 506816 counting only the distinct ones).
The product of its digits is 648000, while the sum is 42.
The spelling of 13256564325 in words is "thirteen billion, two hundred fifty-six million, five hundred sixty-four thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •