Base | Representation |
---|---|
bin | 111101001011000… |
… | …111101010000101 |
3 | 2122112012201101200 |
4 | 331023013222011 |
5 | 4100214401000 |
6 | 245501413113 |
7 | 34301422350 |
oct | 7513075205 |
9 | 2575181350 |
10 | 1026325125 |
11 | 487374291 |
12 | 24786a199 |
13 | 134826597 |
14 | 9a441297 |
15 | 60181500 |
hex | 3d2c7a85 |
1026325125 has 96 divisors (see below), whose sum is σ = 2155196160. Its totient is φ = 460137600.
The previous prime is 1026325121. The next prime is 1026325141. The reversal of 1026325125 is 5215236201.
It is a happy number.
1026325125 is a `hidden beast` number, since 1 + 0 + 2 + 632 + 5 + 1 + 25 = 666.
It is not a de Polignac number, because 1026325125 - 22 = 1026325121 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1026325121) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 416146 + ... + 418604.
It is an arithmetic number, because the mean of its divisors is an integer number (22449960).
Almost surely, 21026325125 is an apocalyptic number.
1026325125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1026325125 is an abundant number, since it is smaller than the sum of its proper divisors (1128871035).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1026325125 is a wasteful number, since it uses less digits than its factorization.
1026325125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2540 (or 2527 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The square root of 1026325125 is about 32036.3094784652. The cubic root of 1026325125 is about 1008.6991470705.
The spelling of 1026325125 in words is "one billion, twenty-six million, three hundred twenty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •