Base | Representation |
---|---|
bin | 1110000111100101001… |
… | …0101001101110110001 |
3 | 212012001221110012110211 |
4 | 3201321102221232301 |
5 | 12433222043214413 |
6 | 303232150424121 |
7 | 23344456225432 |
oct | 3417122515661 |
9 | 765057405424 |
10 | 242553101233 |
11 | 939589a1a63 |
12 | 3b012662041 |
13 | 19b46303a11 |
14 | ba4d7a3489 |
15 | 649917583d |
hex | 38794a9bb1 |
242553101233 has 2 divisors, whose sum is σ = 242553101234. Its totient is φ = 242553101232.
The previous prime is 242553101117. The next prime is 242553101237. The reversal of 242553101233 is 332101355242.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 199516768929 + 43036332304 = 446673^2 + 207452^2 .
It is a cyclic number.
It is not a de Polignac number, because 242553101233 - 221 = 242551004081 is a prime.
It is a super-2 number, since 2×2425531012332 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 242553101195 and 242553101204.
It is not a weakly prime, because it can be changed into another prime (242553101237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121276550616 + 121276550617.
It is an arithmetic number, because the mean of its divisors is an integer number (121276550617).
Almost surely, 2242553101233 is an apocalyptic number.
It is an amenable number.
242553101233 is a deficient number, since it is larger than the sum of its proper divisors (1).
242553101233 is an equidigital number, since it uses as much as digits as its factorization.
242553101233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 242553101233 its reverse (332101355242), we get a palindrome (574654456475).
The spelling of 242553101233 in words is "two hundred forty-two billion, five hundred fifty-three million, one hundred one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •