Search a number
-
+
1052102156497 = 71571279974797
BaseRepresentation
bin11110100111101100010…
…11001110000011010001
310201120122210211012200221
433103312023032003101
5114214201123001442
62123155024313041
7136004033526640
oct17236613160321
93646583735627
101052102156497
1137621526a267
1214baa2a72781
137829c6ccb42
1438cca025357
151c57a94c467
hexf4f62ce0d1

1052102156497 has 16 divisors (see below), whose sum is σ = 1210171801600. Its totient is φ = 895975898688.

The previous prime is 1052102156461. The next prime is 1052102156507. The reversal of 1052102156497 is 7946512012501.

It is a cyclic number.

It is not a de Polignac number, because 1052102156497 - 211 = 1052102154449 is a prime.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14028703 + ... + 14103499.

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

Almost surely, 21052102156497 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 87760.

The product of its (nonzero) digits is 151200, while the sum is 43.

Adding to 1052102156497 its reverse (7946512012501), we get a palindrome (8998614168998).

The spelling of 1052102156497 in words is "one trillion, fifty-two billion, one hundred two million, one hundred fifty-six thousand, four hundred ninety-seven".

Divisors: 1 7 157 1099 12799 74797 89593 523579 2009443 11743129 14066101 82201903 957326803 6701287621 150300308071 1052102156497