Base | Representation |
---|---|
bin | 100010110101111011111000… |
… | …101010011010001100110111 |
3 | 202002120121021010102002120011 |
4 | 202311323320222122030313 |
5 | 130041141022323203443 |
6 | 1301525254023121051 |
7 | 44164140266253421 |
oct | 4265737052321467 |
9 | 662517233362504 |
10 | 153240015053623 |
11 | 449107a85a2193 |
12 | 1522ab36ba3187 |
13 | 676761890b3b4 |
14 | 29babdb99d811 |
15 | 12ab1d00a4b9d |
hex | 8b5ef8a9a337 |
153240015053623 has 2 divisors, whose sum is σ = 153240015053624. Its totient is φ = 153240015053622.
The previous prime is 153240015053557. The next prime is 153240015053641. The reversal of 153240015053623 is 326350510042351.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 153240015053623 - 213 = 153240015045431 is a prime.
It is a super-2 number, since 2×1532400150536232 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (153240015053663) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76620007526811 + 76620007526812.
It is an arithmetic number, because the mean of its divisors is an integer number (76620007526812).
Almost surely, 2153240015053623 is an apocalyptic number.
153240015053623 is a deficient number, since it is larger than the sum of its proper divisors (1).
153240015053623 is an equidigital number, since it uses as much as digits as its factorization.
153240015053623 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324000, while the sum is 40.
Adding to 153240015053623 its reverse (326350510042351), we get a palindrome (479590525095974).
The spelling of 153240015053623 in words is "one hundred fifty-three trillion, two hundred forty billion, fifteen million, fifty-three thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •