Search a number
-
+
1054351431111 = 31122904549397
BaseRepresentation
bin11110101011111000011…
…11100001010111000111
310201210110120020012102010
433111330033201113013
5114233302431243421
62124210134145303
7136113545202606
oct17257417412707
93653416205363
101054351431111
11377169994600
121504101b2233
137856a6c4674
1439060a4ba3d
151c65d14e076
hexf57c3e15c7

1054351431111 has 12 divisors (see below), whose sum is σ = 1545220279736. Its totient is φ = 639000867120.

The previous prime is 1054351431079. The next prime is 1054351431121. The reversal of 1054351431111 is 1111341534501.

It is not a de Polignac number, because 1054351431111 - 25 = 1054351431079 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1452274336 + ... + 1452275061.

Almost surely, 21054351431111 is an apocalyptic number.

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

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

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

1054351431111 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 3600, while the sum is 30.

Adding to 1054351431111 its reverse (1111341534501), we get a palindrome (2165692965612).

The spelling of 1054351431111 in words is "one trillion, fifty-four billion, three hundred fifty-one million, four hundred thirty-one thousand, one hundred eleven".

Divisors: 1 3 11 33 121 363 2904549397 8713648191 31950043367 95850130101 351450477037 1054351431111