Base | Representation |
---|---|
bin | 10001111010100… |
… | …00010000110001 |
3 | 101110202202201020 |
4 | 20331100100301 |
5 | 301432300441 |
6 | 22524530053 |
7 | 3503213613 |
oct | 1075202061 |
9 | 343682636 |
10 | 150275121 |
11 | 7790aa17 |
12 | 423b0929 |
13 | 251971b9 |
14 | 15d5adb3 |
15 | d2d5e66 |
hex | 8f50431 |
150275121 has 32 divisors (see below), whose sum is σ = 219967488. Its totient is φ = 90881280.
The previous prime is 150275101. The next prime is 150275131. The reversal of 150275121 is 121572051.
It is not a de Polignac number, because 150275121 - 26 = 150275057 is a prime.
It is a super-2 number, since 2×1502751212 = 45165223983129282, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 150275091 and 150275100.
It is not an unprimeable number, because it can be changed into a prime (150275101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 169746 + ... + 170628.
It is an arithmetic number, because the mean of its divisors is an integer number (6873984).
Almost surely, 2150275121 is an apocalyptic number.
It is an amenable number.
150275121 is a deficient number, since it is larger than the sum of its proper divisors (69692367).
150275121 is a wasteful number, since it uses less digits than its factorization.
150275121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1021.
The product of its (nonzero) digits is 700, while the sum is 24.
The square root of 150275121 is about 12258.6753362670. The cubic root of 150275121 is about 531.6539302883.
The spelling of 150275121 in words is "one hundred fifty million, two hundred seventy-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •