Search a number
-
+
1563165132141 = 3521055044047
BaseRepresentation
bin10110101111110011111…
…001110000010101101101
312112102210122222022112010
4112233303321300111231
5201102330233212031
63154035205431433
7220635455251524
oct26576371602555
95472718868463
101563165132141
11552a30a69038
12212b50a0b579
13b4537824742
145592c62d4bb
152a9dc90e246
hex16bf3e7056d

1563165132141 has 4 divisors (see below), whose sum is σ = 2084220176192. Its totient is φ = 1042110088092.

The previous prime is 1563165132119. The next prime is 1563165132181. The reversal of 1563165132141 is 1412315613651.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 1563165132141 - 26 = 1563165132077 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 1563165132141.

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 260527522021 + ... + 260527522026.

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

Almost surely, 21563165132141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 521055044050.

The product of its digits is 64800, while the sum is 39.

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

Divisors: 1 3 521055044047 1563165132141