Base | Representation |
---|---|
bin | 1110000101111010010… |
… | …1010010011001010001 |
3 | 212010220201021101021101 |
4 | 3201132211102121101 |
5 | 12431312340022203 |
6 | 303115502224401 |
7 | 23330405362402 |
oct | 3413645223121 |
9 | 763821241241 |
10 | 242105001553 |
11 | 93748a64048 |
12 | 3ab08585101 |
13 | 19aa4520c8c |
14 | ba0a07b9a9 |
15 | 646eb6041d |
hex | 385e952651 |
242105001553 has 2 divisors, whose sum is σ = 242105001554. Its totient is φ = 242105001552.
The previous prime is 242105001493. The next prime is 242105001581. The reversal of 242105001553 is 355100501242.
It is an a-pointer prime, because the next prime (242105001581) can be obtained adding 242105001553 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 235683062784 + 6421938769 = 485472^2 + 80137^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-242105001553 is a prime.
It is a super-2 number, since 2×2421050015532 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (242105001053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121052500776 + 121052500777.
It is an arithmetic number, because the mean of its divisors is an integer number (121052500777).
Almost surely, 2242105001553 is an apocalyptic number.
It is an amenable number.
242105001553 is a deficient number, since it is larger than the sum of its proper divisors (1).
242105001553 is an equidigital number, since it uses as much as digits as its factorization.
242105001553 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6000, while the sum is 28.
Adding to 242105001553 its reverse (355100501242), we get a palindrome (597205502795).
The spelling of 242105001553 in words is "two hundred forty-two billion, one hundred five million, one thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •