Base | Representation |
---|---|
bin | 1000110000101011001… |
… | …1101001010100010101 |
3 | 112101110222000121111011 |
4 | 2030022303221110111 |
5 | 4431213310303401 |
6 | 153050252012221 |
7 | 13605441542503 |
oct | 2141263512425 |
9 | 471428017434 |
10 | 150505166101 |
11 | 589132739a4 |
12 | 25203a61071 |
13 | 11267122b04 |
14 | 73da8cd673 |
15 | 3dad118451 |
hex | 230ace9515 |
150505166101 has 2 divisors, whose sum is σ = 150505166102. Its totient is φ = 150505166100.
The previous prime is 150505166057. The next prime is 150505166113. The reversal of 150505166101 is 101661505051.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88702708900 + 61802457201 = 297830^2 + 248601^2 .
It is a cyclic number.
It is not a de Polignac number, because 150505166101 - 27 = 150505165973 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150505161101) 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 as a sum of consecutive naturals, namely, 75252583050 + 75252583051.
It is an arithmetic number, because the mean of its divisors is an integer number (75252583051).
Almost surely, 2150505166101 is an apocalyptic number.
It is an amenable number.
150505166101 is a deficient number, since it is larger than the sum of its proper divisors (1).
150505166101 is an equidigital number, since it uses as much as digits as its factorization.
150505166101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4500, while the sum is 31.
The spelling of 150505166101 in words is "one hundred fifty billion, five hundred five million, one hundred sixty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •