Search a number
-
+
41520166051 = 7134335330059
BaseRepresentation
bin100110101010110010…
…110111010010100011
310222011121111222021211
4212222302313102203
51140013130303201
631024001130551
72666623405540
oct465262672243
9128147458254
1041520166051
1116677062321
128069029a57
133bb8cb56c0
14201c43dbc7
1511301b6651
hex9aacb74a3

41520166051 has 32 divisors (see below), whose sum is σ = 52440030720. Its totient is φ = 31995177984.

The previous prime is 41520166033. The next prime is 41520166067. The reversal of 41520166051 is 15066102514.

It is not a de Polignac number, because 41520166051 - 29 = 41520165539 is a prime.

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

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

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1366260 + ... + 1396318.

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

Almost surely, 241520166051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 30475.

The product of its (nonzero) digits is 7200, while the sum is 31.

Adding to 41520166051 its reverse (15066102514), we get a palindrome (56586268565).

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

Divisors: 1 7 13 43 91 301 353 559 2471 3913 4589 15179 30059 32123 106253 197327 210413 390767 1292537 1381289 2735369 9047759 10610827 16802981 74275789 117620867 137940751 456265561 965585257 3193858927 5931452293 41520166051