Base | Representation |
---|---|
bin | 10001111100011… |
… | …00001101010101 |
3 | 101111020020112022 |
4 | 20332030031111 |
5 | 302013130121 |
6 | 22534102525 |
7 | 3505255514 |
oct | 1076141525 |
9 | 344206468 |
10 | 150520661 |
11 | 77a68445 |
12 | 424aaa45 |
13 | 25251ba5 |
14 | 15dc267b |
15 | d333aab |
hex | 8f8c355 |
150520661 has 2 divisors, whose sum is σ = 150520662. Its totient is φ = 150520660.
The previous prime is 150520651. The next prime is 150520663. The reversal of 150520661 is 166025051.
150520661 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97318225 + 53202436 = 9865^2 + 7294^2 .
It is a cyclic number.
It is not a de Polignac number, because 150520661 - 210 = 150519637 is a prime.
Together with 150520663, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 150520661.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150520663) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75260330 + 75260331.
It is an arithmetic number, because the mean of its divisors is an integer number (75260331).
Almost surely, 2150520661 is an apocalyptic number.
It is an amenable number.
150520661 is a deficient number, since it is larger than the sum of its proper divisors (1).
150520661 is an equidigital number, since it uses as much as digits as its factorization.
150520661 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1800, while the sum is 26.
The square root of 150520661 is about 12268.6861969813. The cubic root of 150520661 is about 531.9433356366.
The spelling of 150520661 in words is "one hundred fifty million, five hundred twenty thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •