Base | Representation |
---|---|
bin | 10001111100100… |
… | …01001101000101 |
3 | 101111021021121020 |
4 | 20332101031011 |
5 | 302014304000 |
6 | 22534341353 |
7 | 3505402260 |
oct | 1076211505 |
9 | 344237536 |
10 | 150541125 |
11 | 77a81859 |
12 | 424ba859 |
13 | 2525b2b7 |
14 | 15dc9cd7 |
15 | d339ba0 |
hex | 8f91345 |
150541125 has 32 divisors (see below), whose sum is σ = 286291200. Its totient is φ = 68817600.
The previous prime is 150541121. The next prime is 150541159. The reversal of 150541125 is 521145051.
It is not a de Polignac number, because 150541125 - 22 = 150541121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 150541095 and 150541104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150541121) 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 31 ways as a sum of consecutive naturals, for example, 26050 + ... + 31299.
It is an arithmetic number, because the mean of its divisors is an integer number (8946600).
Almost surely, 2150541125 is an apocalyptic number.
150541125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
150541125 is a deficient number, since it is larger than the sum of its proper divisors (135750075).
150541125 is an equidigital number, since it uses as much as digits as its factorization.
150541125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57374 (or 57364 counting only the distinct ones).
The product of its (nonzero) digits is 1000, while the sum is 24.
The square root of 150541125 is about 12269.5201617667. The cubic root of 150541125 is about 531.9674412867.
Adding to 150541125 its reverse (521145051), we get a palindrome (671686176).
The spelling of 150541125 in words is "one hundred fifty million, five hundred forty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •