Search a number
-
+
1056115567 = 1381239659
BaseRepresentation
bin111110111100110…
…000101101101111
32201121021020012101
4332330300231233
54130331144232
6252444115531
735112556063
oct7674605557
92647236171
101056115567
114a2171291
12255835ba7
1313aa57070
14a0397aa3
1562ab81e7
hex3ef30b6f

1056115567 has 4 divisors (see below), whose sum is σ = 1137355240. Its totient is φ = 974875896.

The previous prime is 1056115559. The next prime is 1056115609. The reversal of 1056115567 is 7655116501.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 1056115567 - 23 = 1056115559 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1056115537) by changing a digit.

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

It is an arithmetic number, because the mean of its divisors is an integer number (284338810).

Almost surely, 21056115567 is an apocalyptic number.

1056115567 is a deficient number, since it is larger than the sum of its proper divisors (81239673).

1056115567 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 81239672.

The product of its (nonzero) digits is 31500, while the sum is 37.

The square root of 1056115567 is about 32497.9317341889. The cubic root of 1056115567 is about 1018.3658206797.

The spelling of 1056115567 in words is "one billion, fifty-six million, one hundred fifteen thousand, five hundred sixty-seven".

Divisors: 1 13 81239659 1056115567