Search a number
-
+
150165072002325 = 3522002200960031
BaseRepresentation
bin100010001001001100000111…
…110001100011110100010101
3201200200122022001120100121110
4202021030013301203310111
5124140301031413033300
61251212514242005233
743426032320500362
oct4211140761436425
9650618261510543
10150165072002325
1143935716393886
1214a12bb6946819
1365a3675854433
1429120577b5469
1512562112e7550
hex889307c63d15

150165072002325 has 12 divisors (see below), whose sum is σ = 248272919043968. Its totient is φ = 80088038401200.

The previous prime is 150165072002321. The next prime is 150165072002417. The reversal of 150165072002325 is 523200270561051.

It is not a de Polignac number, because 150165072002325 - 22 = 150165072002321 is a prime.

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1001100479941 + ... + 1001100480090.

Almost surely, 2150165072002325 is an apocalyptic number.

150165072002325 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 2002200960044 (or 2002200960039 counting only the distinct ones).

The product of its (nonzero) digits is 126000, while the sum is 39.

The spelling of 150165072002325 in words is "one hundred fifty trillion, one hundred sixty-five billion, seventy-two million, two thousand, three hundred twenty-five".

Divisors: 1 3 5 15 25 75 2002200960031 6006602880093 10011004800155 30033014400465 50055024000775 150165072002325