Search a number
-
+
1050010560505 = 5210002112101
BaseRepresentation
bin11110100011110011000…
…00011010011111111001
310201101021001010010101201
433101321200122133321
5114200410200414010
62122211310214201
7135601145334304
oct17217140323771
93641231103351
101050010560505
11375341651235
1214b5ba4b4361
137802829528a
1438b6c325b3b
151c4a6ee523a
hexf47981a7f9

1050010560505 has 4 divisors (see below), whose sum is σ = 1260012672612. Its totient is φ = 840008448400.

The previous prime is 1050010560491. The next prime is 1050010560523. The reversal of 1050010560505 is 5050650100501.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 173878992144 + 876131568361 = 416988^2 + 936019^2 .

It is not a de Polignac number, because 1050010560505 - 213 = 1050010552313 is a prime.

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

It is a Duffinian 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, 105001056046 + ... + 105001056055.

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

Almost surely, 21050010560505 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 210002112106.

The product of its (nonzero) digits is 3750, while the sum is 28.

The spelling of 1050010560505 in words is "one trillion, fifty billion, ten million, five hundred sixty thousand, five hundred five".

Divisors: 1 5 210002112101 1050010560505