Search a number
-
+
1061147960 = 23526528699
BaseRepresentation
bin111111001111111…
…101010100111000
32201221201220100022
4333033331110320
54133123213320
6253144030012
735203415555
oct7717752470
92657656308
101061147960
114a4a99194
12257462308
1313bac9802
14a0d07a2c
156325e325
hex3f3fd538

1061147960 has 16 divisors (see below), whose sum is σ = 2387583000. Its totient is φ = 424459168.

The previous prime is 1061147933. The next prime is 1061148013. The reversal of 1061147960 is 697411601.

It is a super-2 number, since 2×10611479602 = 2252069986024323200, which contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 1061147960.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13264310 + ... + 13264389.

Almost surely, 21061147960 is an apocalyptic number.

1061147960 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

1061147960 is an abundant number, since it is smaller than the sum of its proper divisors (1326435040).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

1061147960 is a wasteful number, since it uses less digits than its factorization.

1061147960 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 26528710 (or 26528706 counting only the distinct ones).

The product of its (nonzero) digits is 9072, while the sum is 35.

The square root of 1061147960 is about 32575.2660771942. The cubic root of 1061147960 is about 1019.9807634460.

The spelling of 1061147960 in words is "one billion, sixty-one million, one hundred forty-seven thousand, nine hundred sixty".

Divisors: 1 2 4 5 8 10 20 40 26528699 53057398 106114796 132643495 212229592 265286990 530573980 1061147960