Base | Representation |
---|---|
bin | 1110001001101000000… |
… | …1000111100100101001 |
3 | 212020111012120220220111 |
4 | 3202122001013210221 |
5 | 12440333122344001 |
6 | 303402442454321 |
7 | 23364204130441 |
oct | 3423201074451 |
9 | 766435526814 |
10 | 243102153001 |
11 | 9410a911754 |
12 | 3b1465043a1 |
13 | 19c02ca1716 |
14 | baa2687121 |
15 | 64cc47c851 |
hex | 389a047929 |
243102153001 has 2 divisors, whose sum is σ = 243102153002. Its totient is φ = 243102153000.
The previous prime is 243102152989. The next prime is 243102153013. The reversal of 243102153001 is 100351201342.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (243102152989) and next prime (243102153013).
It can be written as a sum of positive squares in only one way, i.e., 242481395776 + 620757225 = 492424^2 + 24915^2 .
It is a cyclic number.
It is not a de Polignac number, because 243102153001 - 211 = 243102150953 is a prime.
It is a super-2 number, since 2×2431021530012 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (243102153061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121551076500 + 121551076501.
It is an arithmetic number, because the mean of its divisors is an integer number (121551076501).
Almost surely, 2243102153001 is an apocalyptic number.
It is an amenable number.
243102153001 is a deficient number, since it is larger than the sum of its proper divisors (1).
243102153001 is an equidigital number, since it uses as much as digits as its factorization.
243102153001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 720, while the sum is 22.
Adding to 243102153001 its reverse (100351201342), we get a palindrome (343453354343).
The spelling of 243102153001 in words is "two hundred forty-three billion, one hundred two million, one hundred fifty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •