Search a number
-
+
1050561113 = 71131328143
BaseRepresentation
bin111110100111100…
…100101001011001
32201012211000220212
4332213210221121
54122420423423
6252125100505
735014423250
oct7647445131
92635730825
101050561113
1149a018128
122539b7735
13139860ac4
149d74d797
156236c578
hex3e9e4a59

1050561113 has 8 divisors (see below), whose sum is σ = 1211267328. Its totient is φ = 892511424.

The previous prime is 1050561107. The next prime is 1050561131. The reversal of 1050561113 is 3111650501.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 1050561113 - 210 = 1050560089 is a prime.

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

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 663281 + ... + 664862.

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

Almost surely, 21050561113 is an apocalyptic number.

It is an amenable number.

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

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

1050561113 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 1328263.

The product of its (nonzero) digits is 450, while the sum is 23.

The square root of 1050561113 is about 32412.3604971930. The cubic root of 1050561113 is about 1016.5773763858.

The spelling of 1050561113 in words is "one billion, fifty million, five hundred sixty-one thousand, one hundred thirteen".

Divisors: 1 7 113 791 1328143 9297001 150080159 1050561113