Base | Representation |
---|---|
bin | 10001111010000… |
… | …11110100001101 |
3 | 101110200011210002 |
4 | 20331003310031 |
5 | 301424133031 |
6 | 22523454045 |
7 | 3502612154 |
oct | 1075036415 |
9 | 343604702 |
10 | 150224141 |
11 | 77885691 |
12 | 42387325 |
13 | 25179c32 |
14 | 15d4659b |
15 | d2c5ccb |
hex | 8f43d0d |
150224141 has 4 divisors (see below), whose sum is σ = 150249984. Its totient is φ = 150198300.
The previous prime is 150224131. The next prime is 150224149. The reversal of 150224141 is 141422051.
It is a happy number.
150224141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 150224141 - 218 = 149961997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150224149) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 326 + ... + 17336.
It is an arithmetic number, because the mean of its divisors is an integer number (37562496).
Almost surely, 2150224141 is an apocalyptic number.
It is an amenable number.
150224141 is a deficient number, since it is larger than the sum of its proper divisors (25843).
150224141 is an equidigital number, since it uses as much as digits as its factorization.
150224141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25842.
The product of its (nonzero) digits is 320, while the sum is 20.
The square root of 150224141 is about 12256.5958161310. The cubic root of 150224141 is about 531.5938032743.
Adding to 150224141 its reverse (141422051), we get a palindrome (291646192).
The spelling of 150224141 in words is "one hundred fifty million, two hundred twenty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •