Search a number
-
+
151069125 = 353402851
BaseRepresentation
bin10010000000100…
…10000111000101
3101112021002212210
421000102013011
5302133203000
622553534033
73513031524
oct1100220705
9345232783
10151069125
1178302519
1242714319
13253b471c
14160c64bb
15d3e1350
hex90121c5

151069125 has 16 divisors (see below), whose sum is σ = 251379648. Its totient is φ = 80570000.

The previous prime is 151069117. The next prime is 151069141. The reversal of 151069125 is 521960151.

It is not a de Polignac number, because 151069125 - 23 = 151069117 is a prime.

It is a Curzon number.

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2151069125 is an apocalyptic number.

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

It is an amenable number.

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

151069125 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 2700, while the sum is 30.

The square root of 151069125 is about 12291.0180619833. The cubic root of 151069125 is about 532.5886471034.

The spelling of 151069125 in words is "one hundred fifty-one million, sixty-nine thousand, one hundred twenty-five".

Divisors: 1 3 5 15 25 75 125 375 402851 1208553 2014255 6042765 10071275 30213825 50356375 151069125