Base | Representation |
---|---|
bin | 10001111101100… |
… | …00111010110111 |
3 | 101111111212210120 |
4 | 20332300322313 |
5 | 302032433111 |
6 | 22541223023 |
7 | 3506453100 |
oct | 1076607267 |
9 | 344455716 |
10 | 150671031 |
11 | 78060415 |
12 | 42561a73 |
13 | 252a5474 |
14 | 160213a7 |
15 | d363406 |
hex | 8fb0eb7 |
150671031 has 24 divisors (see below), whose sum is σ = 234718704. Its totient is φ = 85720320.
The previous prime is 150671029. The next prime is 150671039. The reversal of 150671031 is 130176051.
It is not a de Polignac number, because 150671031 - 21 = 150671029 is a prime.
It is a super-2 number, since 2×1506710312 = 45403519165205922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 150670992 and 150671010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150671039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 33301 + ... + 37553.
It is an arithmetic number, because the mean of its divisors is an integer number (9779946).
Almost surely, 2150671031 is an apocalyptic number.
150671031 is a deficient number, since it is larger than the sum of its proper divisors (84047673).
150671031 is a wasteful number, since it uses less digits than its factorization.
150671031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4511 (or 4504 counting only the distinct ones).
The product of its (nonzero) digits is 630, while the sum is 24.
The square root of 150671031 is about 12274.8128702641. The cubic root of 150671031 is about 532.1204136482.
The spelling of 150671031 in words is "one hundred fifty million, six hundred seventy-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •