Search a number
-
+
1056100050001 = 174191367108461
BaseRepresentation
bin11110101111001000111…
…01111110010001010001
310201221222102120020120201
433113210131332101101
5114300343103100001
62125055441135201
7136205100211063
oct17274435762121
93657872506521
101056100050001
11377986a44887
1215081992a501
1378788a647b9
1439188d8b733
151c711908501
hexf5e477e451

1056100050001 has 16 divisors (see below), whose sum is σ = 1121722680960. Its totient is φ = 990869735680.

The previous prime is 1056100049951. The next prime is 1056100050041. The reversal of 1056100050001 is 1000500016501.

It is not a de Polignac number, because 1056100050001 - 225 = 1056066495569 is a prime.

It is a super-2 number, since 2×10561000500012 (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 (1056100050041) by changing a digit.

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

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

Almost surely, 21056100050001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 110264.

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

Adding to 1056100050001 its reverse (1000500016501), we get a palindrome (2056600066502).

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

Divisors: 1 17 419 1367 7123 23239 108461 572773 1843837 9737141 45445159 148266187 772567703 2520525179 62123532353 1056100050001