Search a number
BaseRepresentation
bin11110101101000111001…
…00001100000111011101
310201212011112121221001110
433112203210030013131
5114241130324114131
62124355422332233
7136136105621202
oct17264344140735
93655145557043
101055011160541
11377478329038
1215057512a079
13786442a4000
14390c4501ca9
151c69b019646
hexf5a390c1dd

1055011160541 has 16 divisors (see below), whose sum is σ = 1523851663040. Its totient is φ = 649237633200.

The previous prime is 1055011160507. The next prime is 1055011160551. The reversal of 1055011160541 is 1450611105501.

It is not a de Polignac number, because 1055011160541 - 29 = 1055011160029 is a prime.

It is a super-2 number, since 2×10550111605412 (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 = 1055011160499 and 1055011160508.

It is a congruent number.

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

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

Almost surely, 21055011160541 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The spelling of 1055011160541 in words is "one trillion, fifty-five billion, eleven million, one hundred sixty thousand, five hundred forty-one".