Search a number
-
+
1057167433140 = 2235713414722449
BaseRepresentation
bin11110110001001000001…
…01101101110110110100
310202001201211000220222120
433120210011231312310
5114310034330330030
62125353410555540
7136243410626220
oct17304405556664
93661654026876
101057167433140
11378384501605
12150a77298bb0
13788c8c35360
143924aa39780
151c77549a010
hexf62416ddb4

1057167433140 has 192 divisors, whose sum is σ = 3732020006400. Its totient is φ = 217610403840.

The previous prime is 1057167433111. The next prime is 1057167433211. The reversal of 1057167433140 is 413347617501.

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

It is a Harshad number since it is a multiple of its sum of digits (42).

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2137365 + ... + 2585084.

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

Almost surely, 21057167433140 is an apocalyptic number.

1057167433140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

1057167433140 is an abundant number, since it is smaller than the sum of its proper divisors (2674852573260).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 4722522 (or 4722520 counting only the distinct ones).

The product of its (nonzero) digits is 211680, while the sum is 42.

The spelling of 1057167433140 in words is "one trillion, fifty-seven billion, one hundred sixty-seven million, four hundred thirty-three thousand, one hundred forty".