Base | Representation |
---|---|
bin | 1110000101111110111… |
… | …0111010001011011101 |
3 | 212010222001120220011111 |
4 | 3201133232322023131 |
5 | 12431332310113041 |
6 | 303121432022021 |
7 | 23331031413151 |
oct | 3413756721335 |
9 | 763861526144 |
10 | 242124301021 |
11 | 93758946019 |
12 | 3ab12b31911 |
13 | 19aa851a595 |
14 | ba0c863061 |
15 | 64716c3981 |
hex | 385fbba2dd |
242124301021 has 2 divisors, whose sum is σ = 242124301022. Its totient is φ = 242124301020.
The previous prime is 242124300991. The next prime is 242124301051. The reversal of 242124301021 is 120103421242.
It is a balanced prime because it is at equal distance from previous prime (242124300991) and next prime (242124301051).
It can be written as a sum of positive squares in only one way, i.e., 133016301796 + 109107999225 = 364714^2 + 330315^2 .
It is a cyclic number.
It is not a de Polignac number, because 242124301021 - 25 = 242124300989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 242124300983 and 242124301001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (242124301051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121062150510 + 121062150511.
It is an arithmetic number, because the mean of its divisors is an integer number (121062150511).
Almost surely, 2242124301021 is an apocalyptic number.
It is an amenable number.
242124301021 is a deficient number, since it is larger than the sum of its proper divisors (1).
242124301021 is an equidigital number, since it uses as much as digits as its factorization.
242124301021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 242124301021 its reverse (120103421242), we get a palindrome (362227722263).
The spelling of 242124301021 in words is "two hundred forty-two billion, one hundred twenty-four million, three hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •