Search a number
-
+
136951250 = 2543312
BaseRepresentation
bin10000010100110…
…11010111010010
3100112200211210112
420022123113102
5240024420000
621331201322
73252031532
oct1012332722
9315624715
10136951250
117033a557
1239a46242
13224b0757
141428d4c2
15c053235
hex829b5d2

136951250 has 30 divisors (see below), whose sum is σ = 257479299. Its totient is φ = 54615000.

The previous prime is 136951247. The next prime is 136951267. The reversal of 136951250 is 52159631.

It can be written as a sum of positive squares in 3 ways, for example, as 31663129 + 105288121 = 5627^2 + 10261^2 .

It is an ABA number since it can be written as A⋅BA, here for A=2, B=8275.

It is a Duffinian number.

It is an unprimeable number.

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 14 ways as a sum of consecutive naturals, for example, 413585 + ... + 413915.

Almost surely, 2136951250 is an apocalyptic number.

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

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

136951250 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 8100, while the sum is 32.

The square root of 136951250 is about 11702.6172286374. The cubic root of 136951250 is about 515.4525195985.

Multiplying 136951250 by its sum of digits (32), we get a square (4382440000 = 662002).

The spelling of 136951250 in words is "one hundred thirty-six million, nine hundred fifty-one thousand, two hundred fifty".

Divisors: 1 2 5 10 25 50 125 250 331 625 662 1250 1655 3310 8275 16550 41375 82750 109561 206875 219122 413750 547805 1095610 2739025 5478050 13695125 27390250 68475625 136951250