Search a number
-
+
4650214032541 = 71160392390033
BaseRepresentation
bin100001110101011011001…
…0110110000010010011101
3121110120000102002220111101
41003222312112300102131
51102142114243020131
613520140121153101
7656652432044350
oct103526626602235
917416012086441
104650214032541
111533165655010
126312ab32b791
1327968995411c
1412110050a297
1580e69399c61
hex43ab65b049d

4650214032541 has 8 divisors (see below), whose sum is σ = 5797669443264. Its totient is φ = 3623543401920.

The previous prime is 4650214032517. The next prime is 4650214032613. The reversal of 4650214032541 is 1452304120564.

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 4650214032541 - 213 = 4650214024349 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

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

Almost surely, 24650214032541 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 60392390051.

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

The spelling of 4650214032541 in words is "four trillion, six hundred fifty billion, two hundred fourteen million, thirty-two thousand, five hundred forty-one".

Divisors: 1 7 11 77 60392390033 422746730231 664316290363 4650214032541