Search a number
-
+
1056500110070 = 25105650011007
BaseRepresentation
bin11110101111111000101…
…00000101001011110110
310202000000022100101211022
433113330110011023312
5114302203012010240
62125203251541142
7136221025523006
oct17277424051366
93660008311738
101056500110070
11378071850939
1215090b8ba7b2
13788208c7532
14391c616a006
151c736ace9b5
hexf5fc5052f6

1056500110070 has 8 divisors (see below), whose sum is σ = 1901700198144. Its totient is φ = 422600044024.

The previous prime is 1056500110019. The next prime is 1056500110139. The reversal of 1056500110070 is 700110056501.

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

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

It is a Curzon number.

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 21056500110070 is an apocalyptic number.

1056500110070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 105650011014.

The product of its (nonzero) digits is 1050, while the sum is 26.

Adding to 1056500110070 its reverse (700110056501), we get a palindrome (1756610166571).

The spelling of 1056500110070 in words is "one trillion, fifty-six billion, five hundred million, one hundred ten thousand, seventy".

Divisors: 1 2 5 10 105650011007 211300022014 528250055035 1056500110070