Base | Representation |
---|---|
bin | 111110111101111… |
… | …000111110000101 |
3 | 2201121211021011210 |
4 | 332331320332011 |
5 | 4130420132100 |
6 | 252454322033 |
7 | 35115230661 |
oct | 7675707605 |
9 | 2647737153 |
10 | 1056411525 |
11 | 4a2353684 |
12 | 255959319 |
13 | 13ab2b9a0 |
14 | a04338a1 |
15 | 62b25c50 |
hex | 3ef78f85 |
1056411525 has 48 divisors (see below), whose sum is σ = 1892128896. Its totient is φ = 516990720.
The previous prime is 1056411523. The next prime is 1056411547. The reversal of 1056411525 is 5251146501.
It is not a de Polignac number, because 1056411525 - 21 = 1056411523 is a prime.
It is a super-2 number, since 2×10564115252 = 2232010620305651250, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1056411492 and 1056411501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1056411523) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 165544 + ... + 171806.
It is an arithmetic number, because the mean of its divisors is an integer number (39419352).
Almost surely, 21056411525 is an apocalyptic number.
1056411525 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1056411525 is a deficient number, since it is larger than the sum of its proper divisors (835717371).
1056411525 is a wasteful number, since it uses less digits than its factorization.
1056411525 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6462 (or 6457 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 30.
The square root of 1056411525 is about 32502.4849050038. The cubic root of 1056411525 is about 1018.4609382255.
The spelling of 1056411525 in words is "one billion, fifty-six million, four hundred eleven thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •