Search a number
-
+
66161150505 = 3252116967999
BaseRepresentation
bin111101100111100000…
…110000101000101001
320022202212212200100200
4331213200300220221
52040444223304010
650221035022413
74531351333422
oct754740605051
9208685780320
1066161150505
112607127668a
12109a529aa09
13631502a288
1432b8c50649
151ac35bdcc0
hexf67830a29

66161150505 has 24 divisors (see below), whose sum is σ = 115222848000. Its totient is φ = 35118709920.

The previous prime is 66161150479. The next prime is 66161150513. The reversal of 66161150505 is 50505116166.

It is not a de Polignac number, because 66161150505 - 26 = 66161150441 is a prime.

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

It is a Curzon number.

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

It is an unprimeable number.

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 23 ways as a sum of consecutive naturals, for example, 3474505 + ... + 3493494.

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

Almost surely, 266161150505 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 27000, while the sum is 36.

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

Divisors: 1 3 5 9 15 45 211 633 1055 1899 3165 9495 6967999 20903997 34839995 62711991 104519985 313559955 1470247789 4410743367 7351238945 13232230101 22053716835 66161150505