Search a number
-
+
4972690922691 = 310116411521197
BaseRepresentation
bin100100001011100101101…
…1110011101110011000011
3122121101101101021021000110
41020113023132131303003
51122433032334011231
614324231144122403
71022156626302012
oct110271336356303
918541341237013
104972690922691
1116479a742a588
126838a8166403
132a0bcc35801b
1413297288aa79
158953ee88046
hex485cb79dcc3

4972690922691 has 8 divisors (see below), whose sum is σ = 6695900648784. Its totient is φ = 3282304239200.

The previous prime is 4972690922627. The next prime is 4972690922713. The reversal of 4972690922691 is 1962290962794.

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 4972690922691 - 26 = 4972690922627 is a prime.

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

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

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

Almost surely, 24972690922691 is an apocalyptic number.

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

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

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

The sum of its prime factors is 16411521301.

The product of its (nonzero) digits is 52907904, while the sum is 66.

The spelling of 4972690922691 in words is "four trillion, nine hundred seventy-two billion, six hundred ninety million, nine hundred twenty-two thousand, six hundred ninety-one".

Divisors: 1 3 101 303 16411521197 49234563591 1657563640897 4972690922691