Search a number
-
+
1052145233131 = 13137139216259
BaseRepresentation
bin11110100111110001011…
…11100010110011101011
310201120202210212201201211
433103320233202303223
5114214243134430011
62123203203453551
7136005065630536
oct17237057426353
93646683781654
101052145233131
11376237611393
1214bab53872b7
13782a8602b85
1438cd1a39a1d
151c57e60ab21
hexf4f8be2ceb

1052145233131 has 8 divisors (see below), whose sum is σ = 1060210324800. Its totient is φ = 1044080648520.

The previous prime is 1052145233107. The next prime is 1052145233143. The reversal of 1052145233131 is 1313325412501.

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

It is a cyclic number.

It is not a de Polignac number, because 1052145233131 - 213 = 1052145224939 is a prime.

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

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (1052145233101) 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, 4757080 + ... + 4973338.

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

Almost surely, 21052145233131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 253529.

The product of its (nonzero) digits is 10800, while the sum is 31.

The spelling of 1052145233131 in words is "one trillion, fifty-two billion, one hundred forty-five million, two hundred thirty-three thousand, one hundred thirty-one".

Divisors: 1 131 37139 216259 4865209 28329929 8031643001 1052145233131