Search a number
-
+
1055550005150 = 25210122069503
BaseRepresentation
bin11110101110000111010…
…11101101111110011110
310201220120002120001220012
433113003223231332132
5114243231300131100
62124525111523222
7136155341001554
oct17270353557636
93656502501805
101055550005150
11377724506a63
121506a5689512
13786cbb09a84
1439135cc9bd4
151c6cd4a7135
hexf5c3aedf9e

1055550005150 has 36 divisors (see below), whose sum is σ = 1982955273216. Its totient is φ = 418039404000.

The previous prime is 1055550005143. The next prime is 1055550005161. The reversal of 1055550005150 is 515000555501.

It is a super-2 number, since 2×10555500051502 (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 polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 524702 + ... + 1544801.

Almost surely, 21055550005150 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 2069717 (or 2069611 counting only the distinct ones).

The product of its (nonzero) digits is 15625, while the sum is 32.

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

Divisors: 1 2 5 10 25 50 101 202 505 1010 2525 5050 10201 20402 51005 102010 255025 510050 2069503 4139006 10347515 20695030 51737575 103475150 209019803 418039606 1045099015 2090198030 5225495075 10450990150 21111000103 42222000206 105555000515 211110001030 527775002575 1055550005150