Search a number
-
+
1050055600053 = 3607576636793
BaseRepresentation
bin11110100011111000011…
…00001110011110110101
310201101101011212101001010
433101330030032132311
5114201003213200203
62122215555422433
7135602233222035
oct17217414163665
93641334771033
101050055600053
113753650140a9
1214b6115b4a19
13780347048b5
1438b742cb8c5
151c4aae40303
hexf47c30e7b5

1050055600053 has 8 divisors (see below), whose sum is σ = 1402380683008. Its totient is φ = 698883791904.

The previous prime is 1050055600051. The next prime is 1050055600067. The reversal of 1050055600053 is 3500065500501.

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

It is not a de Polignac number, because 1050055600053 - 21 = 1050055600051 is a prime.

It is a super-2 number, since 2×10500556000532 (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 (1050055600051) by changing a digit.

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 7 ways as a sum of consecutive naturals, for example, 288316576 + ... + 288320217.

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

Almost surely, 21050055600053 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 576637403.

The product of its (nonzero) digits is 11250, while the sum is 30.

The spelling of 1050055600053 in words is "one trillion, fifty billion, fifty-five million, six hundred thousand, fifty-three".

Divisors: 1 3 607 1821 576636793 1729910379 350018533351 1050055600053