Base | Representation |
---|---|
bin | 100010010001001110110110… |
… | …110110010110110101100001 |
3 | 201202122110220012010002112102 |
4 | 202101032312312112311201 |
5 | 124223324440330232221 |
6 | 1252314441352540145 |
7 | 43513666502263241 |
oct | 4221166666266541 |
9 | 652573805102472 |
10 | 150717765086561 |
11 | 44029055207382 |
12 | 14aa21426b1655 |
13 | 661381667689a |
14 | 2930ac8c7bb21 |
15 | 12657ace3b30b |
hex | 8913b6d96d61 |
150717765086561 has 2 divisors, whose sum is σ = 150717765086562. Its totient is φ = 150717765086560.
The previous prime is 150717765086519. The next prime is 150717765086591. The reversal of 150717765086561 is 165680567717051.
It is a happy number.
150717765086561 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., 113429827318336 + 37287937768225 = 10650344^2 + 6106385^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-150717765086561 is a prime.
It is not a weakly prime, because it can be changed into another prime (150717765086591) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75358882543280 + 75358882543281.
It is an arithmetic number, because the mean of its divisors is an integer number (75358882543281).
Almost surely, 2150717765086561 is an apocalyptic number.
It is an amenable number.
150717765086561 is a deficient number, since it is larger than the sum of its proper divisors (1).
150717765086561 is an equidigital number, since it uses as much as digits as its factorization.
150717765086561 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 74088000, while the sum is 65.
The spelling of 150717765086561 in words is "one hundred fifty trillion, seven hundred seventeen billion, seven hundred sixty-five million, eighty-six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •