Search a number
-
+
54031510151 = 411317841711
BaseRepresentation
bin110010010100100001…
…110110101010000111
312011110112211002212122
4302110201312222013
51341124031311101
640453254440155
73621644154443
oct622441665207
9164415732778
1054031510151
1120a07419323
12a57b06305b
1351310748a8
142887d27823
15161379151b
hexc94876a87

54031510151 has 4 divisors (see below), whose sum is σ = 55349351904. Its totient is φ = 52713668400.

The previous prime is 54031510097. The next prime is 54031510157. The reversal of 54031510151 is 15101513045.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 15101513045 = 53020302609.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-54031510151 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 54031510151.

It is a congruent number.

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

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

Almost surely, 254031510151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1317841752.

The product of its (nonzero) digits is 1500, while the sum is 26.

The spelling of 54031510151 in words is "fifty-four billion, thirty-one million, five hundred ten thousand, one hundred fifty-one".

Divisors: 1 41 1317841711 54031510151