Search a number
-
+
151410049037 = 1325182156519
BaseRepresentation
bin1000110100000010111…
…1100000000000001101
3112110211000201102111222
42031000233200000031
54440041433032122
6153320134453125
713640040116252
oct2150057400015
9473730642458
10151410049037
1159238030935
1225416b041a5
131137c738bc0
147484b5b429
153e127abb42
hex2340be000d

151410049037 has 16 divisors (see below), whose sum is σ = 163908904320. Its totient is φ = 139034280000.

The previous prime is 151410049027. The next prime is 151410049067. The reversal of 151410049037 is 730940014151.

It is a cyclic number.

It is not a de Polignac number, because 151410049037 - 28 = 151410048781 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2650664 + ... + 2707182.

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

Almost surely, 2151410049037 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 57604.

The product of its (nonzero) digits is 15120, while the sum is 35.

The spelling of 151410049037 in words is "one hundred fifty-one billion, four hundred ten million, forty-nine thousand, thirty-seven".

Divisors: 1 13 251 821 3263 10673 56519 206071 734747 2678923 14186269 46402099 184421497 603227287 11646926849 151410049037