Base | Representation |
---|---|
bin | 1001011101111100100… |
… | …10010000100001101101 |
3 | 1011002200202120111112022 |
4 | 10232332102100201231 |
5 | 20312221120121100 |
6 | 405240405315525 |
7 | 32334415625300 |
oct | 4567622204155 |
9 | 1132622514468 |
10 | 325315004525 |
11 | 115a68925945 |
12 | 5306b405ba5 |
13 | 248a56b7624 |
14 | 11a61286b37 |
15 | 86ded55e85 |
hex | 4bbe49086d |
325315004525 has 72 divisors (see below), whose sum is σ = 476548577064. Its totient is φ = 219614976000.
The previous prime is 325315004459. The next prime is 325315004537. The reversal of 325315004525 is 525400513523.
It can be written as a sum of positive squares in 12 ways, for example, as 94527962116 + 230787042409 = 307454^2 + 480403^2 .
It is not a de Polignac number, because 325315004525 - 228 = 325046569069 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 53741399 + ... + 53747451.
It is an arithmetic number, because the mean of its divisors is an integer number (6618730237).
Almost surely, 2325315004525 is an apocalyptic number.
325315004525 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
325315004525 is a deficient number, since it is larger than the sum of its proper divisors (151233572539).
325315004525 is a wasteful number, since it uses less digits than its factorization.
325315004525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6751 (or 6739 counting only the distinct ones).
The product of its (nonzero) digits is 90000, while the sum is 35.
The spelling of 325315004525 in words is "three hundred twenty-five billion, three hundred fifteen million, four thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •