Search a number
-
+
1056047407301 = 11310139921743
BaseRepresentation
bin11110101111000010101…
…01001010000011000101
310201221211202111201101002
433113201111022003011
5114300241114013201
62125050320543045
7136203560565605
oct17274125120305
93657752451332
101056047407301
1137795a259617
12150804181a85
137877ab92583
1439181da6c05
151c70beaa76b
hexf5e154a0c5

1056047407301 has 8 divisors (see below), whose sum is σ = 1065499194240. Its totient is φ = 1046597484352.

The previous prime is 1056047407297. The next prime is 1056047407477. The reversal of 1056047407301 is 1037047406501.

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

It is a cyclic number.

It is not a de Polignac number, because 1056047407301 - 22 = 1056047407297 is a prime.

It is a super-2 number, since 2×10560474073012 (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 (1056047407201) 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 7 ways as a sum of consecutive naturals, for example, 684836 + ... + 1606578.

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

Almost surely, 21056047407301 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 931995.

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

The spelling of 1056047407301 in words is "one trillion, fifty-six billion, forty-seven million, four hundred seven thousand, three hundred one".

Divisors: 1 113 10139 921743 1145707 104156959 9345552277 1056047407301