Search a number
-
+
1000550910055 = 51463313675267
BaseRepresentation
bin11101000111101010111…
…10110100100001100111
310112122121010001120000011
432203311132310201213
5112343112013110210
62043351410231051
7132200404260544
oct16436536644147
93478533046004
101000550910055
113563709a4864
12141ab6585487
1373475467318
14365d9691bcb
151b05ecd8d8a
hexe8f57b4867

1000550910055 has 8 divisors (see below), whose sum is σ = 1200743231472. Its totient is φ = 800385968448.

The previous prime is 1000550910031. The next prime is 1000550910061. The reversal of 1000550910055 is 5500190550001.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1000550910055 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 1000550909999 and 1000550910026.

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

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

Almost surely, 21000550910055 is an apocalyptic number.

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

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

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

The sum of its prime factors is 13689905.

The product of its (nonzero) digits is 5625, while the sum is 31.

The spelling of 1000550910055 in words is "one trillion, five hundred fifty million, nine hundred ten thousand, fifty-five".

Divisors: 1 5 14633 73165 13675267 68376335 200110182011 1000550910055