Base | Representation |
---|---|
bin | 101110111011101010100… |
… | …011000010010101000101 |
3 | 102102022200222112001211110 |
4 | 232323222203002111011 |
5 | 410320112043301000 |
6 | 10505341314555233 |
7 | 452003325066540 |
oct | 56735243022505 |
9 | 12368628461743 |
10 | 3225160525125 |
11 | 10338680448a0 |
12 | 441083898b19 |
13 | 1a51926cb066 |
14 | b21547c9857 |
15 | 58d619e8850 |
hex | 2eeea8c2545 |
3225160525125 has 64 divisors (see below), whose sum is σ = 6690909708288. Its totient is φ = 1340326440000.
The previous prime is 3225160525091. The next prime is 3225160525133. The reversal of 3225160525125 is 5215250615223.
3225160525125 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 3225160525125 - 211 = 3225160523077 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 55818061 + ... + 55875810.
It is an arithmetic number, because the mean of its divisors is an integer number (104545464192).
Almost surely, 23225160525125 is an apocalyptic number.
3225160525125 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
3225160525125 is an abundant number, since it is smaller than the sum of its proper divisors (3465749183163).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3225160525125 is a wasteful number, since it uses less digits than its factorization.
3225160525125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111693907 (or 111693897 counting only the distinct ones).
The product of its (nonzero) digits is 180000, while the sum is 39.
The spelling of 3225160525125 in words is "three trillion, two hundred twenty-five billion, one hundred sixty million, five hundred twenty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •