Base | Representation |
---|---|
bin | 10001111011110… |
… | …01011001111001 |
3 | 101111002022212201 |
4 | 20331321121321 |
5 | 302003144031 |
6 | 22532310201 |
7 | 3504515125 |
oct | 1075713171 |
9 | 344068781 |
10 | 150443641 |
11 | 77a15597 |
12 | 42472361 |
13 | 25225b0a |
14 | 15da2585 |
15 | d31ad61 |
hex | 8f79679 |
150443641 has 4 divisors (see below), whose sum is σ = 151933284. Its totient is φ = 148954000.
The previous prime is 150443599. The next prime is 150443647. The reversal of 150443641 is 146344051.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 135233641 + 15210000 = 11629^2 + 3900^2 .
It is a cyclic number.
It is not a de Polignac number, because 150443641 - 213 = 150435449 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (150443647) 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 3 ways as a sum of consecutive naturals, for example, 744670 + ... + 744871.
It is an arithmetic number, because the mean of its divisors is an integer number (37983321).
Almost surely, 2150443641 is an apocalyptic number.
It is an amenable number.
150443641 is a deficient number, since it is larger than the sum of its proper divisors (1489643).
150443641 is a wasteful number, since it uses less digits than its factorization.
150443641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1489642.
The product of its (nonzero) digits is 5760, while the sum is 28.
The square root of 150443641 is about 12265.5469099425. The cubic root of 150443641 is about 531.8525900308.
Adding to 150443641 its reverse (146344051), we get a palindrome (296787692).
The spelling of 150443641 in words is "one hundred fifty million, four hundred forty-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •