Search a number
-
+
60215145661 = 11101109497239
BaseRepresentation
bin111000000101000110…
…100011010010111101
312202102111102100010001
4320011012203102331
51441310034130121
643355031314301
74231121202346
oct700506432275
9182374370101
1060215145661
112359a9751a0
12b805b1b991
1358a81b8208
142cb32990cd
15187659e991
hexe051a34bd

60215145661 has 16 divisors (see below), whose sum is σ = 66948393600. Its totient is φ = 53701704000.

The previous prime is 60215145637. The next prime is 60215145677. The reversal of 60215145661 is 16654151206.

It is a cyclic number.

It is not a de Polignac number, because 60215145661 - 29 = 60215145149 is a prime.

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

It is a congruent number.

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

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

Almost surely, 260215145661 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 497460.

The product of its (nonzero) digits is 43200, while the sum is 37.

Adding to 60215145661 its reverse (16654151206), we get a palindrome (76869296867).

The spelling of 60215145661 in words is "sixty billion, two hundred fifteen million, one hundred forty-five thousand, six hundred sixty-one".

Divisors: 1 11 101 109 1111 1199 11009 121099 497239 5469629 50221139 54199051 552432529 596189561 5474104151 60215145661