Search a number
-
+
1050100010605 = 5210020002121
BaseRepresentation
bin11110100011111101101…
…01101000111001101101
310201101111021102122212101
433101332311220321231
5114201101100314410
62122224223335101
7135603312546622
oct17217665507155
93641437378771
101050100010605
11375388097438
1214b624451491
1378040983b29
1438b7a16c349
151c4aecb3d3a
hexf47ed68e6d

1050100010605 has 4 divisors (see below), whose sum is σ = 1260120012732. Its totient is φ = 840080008480.

The previous prime is 1050100010593. The next prime is 1050100010611. The reversal of 1050100010605 is 5060100010501.

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 448822283364 + 601277727241 = 669942^2 + 775421^2 .

It is not a de Polignac number, because 1050100010605 - 235 = 1015740272237 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 21050100010605 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 210020002126.

The product of its (nonzero) digits is 150, while the sum is 19.

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

Divisors: 1 5 210020002121 1050100010605