Base | Representation |
---|---|
bin | 100010110010110010111100… |
… | …001101101101110101110101 |
3 | 202001210222100021011110021121 |
4 | 202302302330031231311311 |
5 | 130024122132122043013 |
6 | 1301242212055343541 |
7 | 44142431426146201 |
oct | 4262627415556565 |
9 | 661728307143247 |
10 | 153024252534133 |
11 | 44838248248882 |
12 | 151b5160681bb1 |
13 | 6750181ab4116 |
14 | 29b05b02c7b01 |
15 | 12a57a2de958d |
hex | 8b2cbc36dd75 |
153024252534133 has 2 divisors, whose sum is σ = 153024252534134. Its totient is φ = 153024252534132.
The previous prime is 153024252534077. The next prime is 153024252534143. The reversal of 153024252534133 is 331435252420351.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 152550609895044 + 473642639089 = 12351138^2 + 688217^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-153024252534133 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 153024252534133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (153024252534143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76512126267066 + 76512126267067.
It is an arithmetic number, because the mean of its divisors is an integer number (76512126267067).
Almost surely, 2153024252534133 is an apocalyptic number.
It is an amenable number.
153024252534133 is a deficient number, since it is larger than the sum of its proper divisors (1).
153024252534133 is an equidigital number, since it uses as much as digits as its factorization.
153024252534133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296000, while the sum is 43.
The spelling of 153024252534133 in words is "one hundred fifty-three trillion, twenty-four billion, two hundred fifty-two million, five hundred thirty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •