Search a number
-
+
4906959186361 = 14973944563751
BaseRepresentation
bin100011101100111110110…
…0011110010100110111001
3122101002201102102002011111
41013121331203302212321
51120343423022430421
614234120445000321
71014342010615531
oct107317543624671
918332642362144
104906959186361
11162203659a151
126730028530a1
1329795529a79b
1412d6d8a9a4c1
158799443cee1
hex4767d8f29b9

4906959186361 has 8 divisors (see below), whose sum is σ = 4946576472000. Its totient is φ = 4867431030000.

The previous prime is 4906959186347. The next prime is 4906959186373. The reversal of 4906959186361 is 1636819596094.

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

It is a cyclic number.

It is not a de Polignac number, because 4906959186361 - 25 = 4906959186329 is a prime.

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

It is a Duffinian number.

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

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

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

Almost surely, 24906959186361 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 44564639.

The product of its (nonzero) digits is 75582720, while the sum is 67.

The spelling of 4906959186361 in words is "four trillion, nine hundred six billion, nine hundred fifty-nine million, one hundred eighty-six thousand, three hundred sixty-one".

Divisors: 1 149 739 110111 44563751 6639998899 32932611989 4906959186361