Search a number
-
+
60610010131 = 115510000921
BaseRepresentation
bin111000011100101000…
…110101110000010011
312210110000102112100001
4320130220311300103
51443112130311011
643502134510431
74243654404616
oct703450656023
9183400375301
1060610010131
1123782852770
12b8b6205417
13593bc4c128
142d0d8c417d
15189b09b7c1
hexe1ca35c13

60610010131 has 4 divisors (see below), whose sum is σ = 66120011064. Its totient is φ = 55100009200.

The previous prime is 60610010093. The next prime is 60610010147. The reversal of 60610010131 is 13101001606.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 60610010131 - 29 = 60610009619 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 60610010099 and 60610010108.

It is not an unprimeable number, because it can be changed into a prime (60610010161) 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 3 ways as a sum of consecutive naturals, for example, 2755000450 + ... + 2755000471.

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

Almost surely, 260610010131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5510000932.

The product of its (nonzero) digits is 108, while the sum is 19.

Adding to 60610010131 its reverse (13101001606), we get a palindrome (73711011737).

The spelling of 60610010131 in words is "sixty billion, six hundred ten million, ten thousand, one hundred thirty-one".

Divisors: 1 11 5510000921 60610010131