Search a number
-
+
57990635151 = 319330211717
BaseRepresentation
bin110110000000100000…
…101101111010001111
312112200110121111100220
4312000200231322033
51422231100311101
642350204322423
74122030160101
oct660040557217
9175613544326
1057990635151
1122659224559
12b2a4b43413
1356123843c7
142b41a7b571
151796140636
hexd8082de8f

57990635151 has 4 divisors (see below), whose sum is σ = 77320846872. Its totient is φ = 38660423432.

The previous prime is 57990635141. The next prime is 57990635179. The reversal of 57990635151 is 15153609975.

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 57990635151 - 27 = 57990635023 is a prime.

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

It is a congruent number.

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

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

Almost surely, 257990635151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 19330211720.

The product of its (nonzero) digits is 1275750, while the sum is 51.

The spelling of 57990635151 in words is "fifty-seven billion, nine hundred ninety million, six hundred thirty-five thousand, one hundred fifty-one".

Divisors: 1 3 19330211717 57990635151