Base | Representation |
---|---|
bin | 10001111100101… |
… | …00101000011001 |
3 | 101111021222212002 |
4 | 20332110220121 |
5 | 302020231121 |
6 | 22534530345 |
7 | 3505461221 |
oct | 1076245031 |
9 | 344258762 |
10 | 150555161 |
11 | 77a91359 |
12 | 425069b5 |
13 | 252647c3 |
14 | 15dd1081 |
15 | d33de0b |
hex | 8f94a19 |
150555161 has 4 divisors (see below), whose sum is σ = 150603792. Its totient is φ = 150506532.
The previous prime is 150555149. The next prime is 150555173. The reversal of 150555161 is 161555051.
It is a happy number.
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 an interprime number because it is at equal distance from previous prime (150555149) and next prime (150555173).
It is a cyclic number.
It is not a de Polignac number, because 150555161 - 214 = 150538777 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (150555101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19331 + ... + 25976.
It is an arithmetic number, because the mean of its divisors is an integer number (37650948).
Almost surely, 2150555161 is an apocalyptic number.
It is an amenable number.
150555161 is a deficient number, since it is larger than the sum of its proper divisors (48631).
150555161 is an equidigital number, since it uses as much as digits as its factorization.
150555161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48630.
The product of its (nonzero) digits is 3750, while the sum is 29.
The square root of 150555161 is about 12270.0921349434. The cubic root of 150555161 is about 531.9839737856.
The spelling of 150555161 in words is "one hundred fifty million, five hundred fifty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •