Search a number
-
+
103661020551 = 3113977912451
BaseRepresentation
bin110000010001010101…
…1011010010110000111
3100220120022111110022110
41200202223122112013
53144244210124201
6115342103232103
710326550064544
oct1404253322607
9326508443273
10103661020551
113aa64a42020
121810ba48633
139a101361aa
145035375bcb
152a6a8516d6
hex1822ada587

103661020551 has 16 divisors (see below), whose sum is σ = 151159483008. Its totient is φ = 62666604000.

The previous prime is 103661020523. The next prime is 103661020607. The reversal of 103661020551 is 155020166301.

It is not a de Polignac number, because 103661020551 - 27 = 103661020423 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2103661020551 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 7912862.

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

Adding to 103661020551 its reverse (155020166301), we get a palindrome (258681186852).

The spelling of 103661020551 in words is "one hundred three billion, six hundred sixty-one million, twenty thousand, five hundred fifty-one".

Divisors: 1 3 11 33 397 1191 4367 13101 7912451 23737353 87036961 261110883 3141243047 9423729141 34553673517 103661020551