Base | Representation |
---|---|
bin | 10001111001110… |
… | …00001010101111 |
3 | 101110120202100001 |
4 | 20330320022233 |
5 | 301421121211 |
6 | 22522445131 |
7 | 3502323106 |
oct | 1074701257 |
9 | 343522301 |
10 | 150176431 |
11 | 77852859 |
12 | 423637a7 |
13 | 251612c2 |
14 | 15d3303d |
15 | d2b6ac1 |
hex | 8f382af |
150176431 has 12 divisors (see below), whose sum is σ = 157398592. Its totient is φ = 143285100.
The previous prime is 150176423. The next prime is 150176441. The reversal of 150176431 is 134671051.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It is not a de Polignac number, because 150176431 - 23 = 150176423 is a prime.
It is a super-2 number, since 2×1501764312 = 45105920855795522, which contains 22 as substring.
It is a Smith number, since the sum of its digits (28) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 150176431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150176441) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2115126 + ... + 2115196.
Almost surely, 2150176431 is an apocalyptic number.
150176431 is a deficient number, since it is larger than the sum of its proper divisors (7222161).
150176431 is an frugal number, since it uses more digits than its factorization.
150176431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235 (or 102 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 28.
The square root of 150176431 is about 12254.6493625889. The cubic root of 150176431 is about 531.5375206520.
The spelling of 150176431 in words is "one hundred fifty million, one hundred seventy-six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •