Base | Representation |
---|---|
bin | 100010001001101110000110… |
… | …010101111011000000000101 |
3 | 201200211010110122010221002000 |
4 | 202021232012111323000011 |
5 | 124141400241112431203 |
6 | 1251241350351335513 |
7 | 43431463362540225 |
oct | 4211560625730005 |
9 | 650733418127060 |
10 | 150201555202053 |
11 | 4394a13818a813 |
12 | 14a1a098b21599 |
13 | 65a6c3b137494 |
14 | 2913b18c90085 |
15 | 12571491a44a3 |
hex | 889b8657b005 |
150201555202053 has 32 divisors (see below), whose sum is σ = 225504896762880. Its totient is φ = 98794784234160.
The previous prime is 150201555202043. The next prime is 150201555202081. The reversal of 150201555202053 is 350202555102051.
150201555202053 is a `hidden beast` number, since 1 + 5 + 0 + 20 + 15 + 552 + 0 + 20 + 53 = 666.
It is not a de Polignac number, because 150201555202053 - 236 = 150132835725317 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 150201555201999 and 150201555202017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150201555202043) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 43438803 + ... + 46768928.
It is an arithmetic number, because the mean of its divisors is an integer number (7047028023840).
Almost surely, 2150201555202053 is an apocalyptic number.
It is an amenable number.
150201555202053 is a deficient number, since it is larger than the sum of its proper divisors (75303341560827).
150201555202053 is an equidigital number, since it uses as much as digits as its factorization.
150201555202053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90208566 (or 90208560 counting only the distinct ones).
The product of its (nonzero) digits is 75000, while the sum is 36.
The spelling of 150201555202053 in words is "one hundred fifty trillion, two hundred one billion, five hundred fifty-five million, two hundred two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.048 sec. • engine limits •