Search a number
-
+
1056061050537 = 3393978935207
BaseRepresentation
bin11110101111000100010…
…01001100111010101001
310201221212201011212101010
433113202021030322221
5114300303112104122
62125051525214133
7136204114551033
oct17274211147251
93657781155333
101056061050537
11377966a27a19
12150808861349
137878095b4ac
1439183b18c53
151c70d2a2e0c
hexf5e224cea9

1056061050537 has 8 divisors (see below), whose sum is σ = 1408117299136. Its totient is φ = 704022751152.

The previous prime is 1056061050487. The next prime is 1056061050553. The reversal of 1056061050537 is 7350501606501.

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

It is not a de Polignac number, because 1056061050537 - 211 = 1056061048489 is a prime.

It is a super-3 number, since 3×10560610505373 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4349413 + ... + 4585794.

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

Almost surely, 21056061050537 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 8974607.

The product of its (nonzero) digits is 94500, while the sum is 39.

The spelling of 1056061050537 in words is "one trillion, fifty-six billion, sixty-one million, fifty thousand, five hundred thirty-seven".

Divisors: 1 3 39397 118191 8935207 26805621 352020350179 1056061050537