Search a number
-
+
1106050001051 = 10613104216527
BaseRepresentation
bin10000000110000101101…
…101111010100010011011
310220201220112012122221202
4100012011231322202123
5121110142300013201
62204040134024415
7142623643613402
oct20060555724233
93821815178852
101106050001051
11397089433366
1215a439aa810b
13803b932ca58
143b766bb0639
151db86bb3c6b
hex10185b7a89b

1106050001051 has 4 divisors (see below), whose sum is σ = 1106154228192. Its totient is φ = 1105945773912.

The previous prime is 1106050001047. The next prime is 1106050001081. The reversal of 1106050001051 is 1501000506011.

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

It is a cyclic number.

It is not a de Polignac number, because 1106050001051 - 22 = 1106050001047 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (1106050001081) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 21106050001051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 104227140.

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

Adding to 1106050001051 its reverse (1501000506011), we get a palindrome (2607050507062).

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

Divisors: 1 10613 104216527 1106050001051