Base | Representation |
---|---|
bin | 10001111100100… |
… | …01101100010101 |
3 | 101111021101100022 |
4 | 20332101230111 |
5 | 302014340000 |
6 | 22534354525 |
7 | 3505411145 |
oct | 1076215425 |
9 | 344241308 |
10 | 150543125 |
11 | 77a83307 |
12 | 424bba45 |
13 | 2525c195 |
14 | 15dca925 |
15 | d33a585 |
hex | 8f91b15 |
150543125 has 10 divisors (see below), whose sum is σ = 188119470. Its totient is φ = 120434000.
The previous prime is 150543097. The next prime is 150543139. The reversal of 150543125 is 521345051.
150543125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 5 ways, for example, as 84511249 + 66031876 = 9193^2 + 8126^2 .
It is not a de Polignac number, because 150543125 - 226 = 83434261 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 150543094 and 150543103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 119810 + ... + 121059.
It is an arithmetic number, because the mean of its divisors is an integer number (18811947).
Almost surely, 2150543125 is an apocalyptic number.
It is an amenable number.
150543125 is a deficient number, since it is larger than the sum of its proper divisors (37576345).
150543125 is an frugal number, since it uses more digits than its factorization.
150543125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 240889 (or 240874 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 26.
The square root of 150543125 is about 12269.6016642758. The cubic root of 150543125 is about 531.9697970774.
Adding to 150543125 its reverse (521345051), we get a palindrome (671888176).
The spelling of 150543125 in words is "one hundred fifty million, five hundred forty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •