Search a number
-
+
1050732030791 = 3892701110619
BaseRepresentation
bin11110100101001001000…
…00100110101101000111
310201110010022200121120102
433102210200212231013
5114203344344441131
62122411041554315
7135625055620232
oct17224440465507
93643108617512
101050732030791
11375681925573
1214b78004599b
13781118b1081
1438bda08c419
151c4ea5091cb
hexf4a4826b47

1050732030791 has 4 divisors (see below), whose sum is σ = 1053433141800. Its totient is φ = 1048030919784.

The previous prime is 1050732030763. The next prime is 1050732030839. The reversal of 1050732030791 is 1970302370501.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1050732030791 is a prime.

It is a super-2 number, since 2×10507320307912 (a number of 25 digits) 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 (1050732030701) by changing a digit.

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

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

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

Almost surely, 21050732030791 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2701111008.

The product of its (nonzero) digits is 39690, while the sum is 38.

The spelling of 1050732030791 in words is "one trillion, fifty billion, seven hundred thirty-two million, thirty thousand, seven hundred ninety-one".

Divisors: 1 389 2701110619 1050732030791