Search a number
-
+
61046931131 = 239972662201
BaseRepresentation
bin111000110110101011…
…100011111010111011
312211120110120102021022
4320312223203322323
52000011003244011
644013343333055
74260541232024
oct706653437273
9184513512238
1061046931131
11239874459aa
12b9b85b118b
1359ab619974
142d51939c4b
1518c46048db
hexe36ae3ebb

61046931131 has 8 divisors (see below), whose sum is σ = 63765062304. Its totient is φ = 58334126400.

The previous prime is 61046931089. The next prime is 61046931149. The reversal of 61046931131 is 13113964016.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-61046931131 is a prime.

It is a super-2 number, since 2×610469311312 (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 = 61046931091 and 61046931100.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1308170 + ... + 1354031.

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

Almost surely, 261046931131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2663221.

The product of its (nonzero) digits is 11664, while the sum is 35.

The spelling of 61046931131 in words is "sixty-one billion, forty-six million, nine hundred thirty-one thousand, one hundred thirty-one".

Divisors: 1 23 997 22931 2662201 61230623 2654214397 61046931131