Search a number
-
+
1056111049973 = 7150873007139
BaseRepresentation
bin11110101111001010001…
…11111011110011110101
310201222000012021002201002
433113211013323303311
5114300403412044343
62125100513013045
7136205262544010
oct17274507736365
93658005232632
101056111049973
11377992178271
12150821554185
137878b116565
143918a612377
151c71287c8b8
hexf5e51fbcf5

1056111049973 has 4 divisors (see below), whose sum is σ = 1206984057120. Its totient is φ = 905238042828.

The previous prime is 1056111049969. The next prime is 1056111049979. The reversal of 1056111049973 is 3799401116501.

It is a happy number.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 1056111049973 - 22 = 1056111049969 is a prime.

It is a super-2 number, since 2×10561110499732 (a number of 25 digits) contains 22 as substring.

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1056111049979) 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, 75436503563 + ... + 75436503576.

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

Almost surely, 21056111049973 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 150873007146.

The product of its (nonzero) digits is 204120, while the sum is 47.

The spelling of 1056111049973 in words is "one trillion, fifty-six billion, one hundred eleven million, forty-nine thousand, nine hundred seventy-three".

Divisors: 1 7 150873007139 1056111049973