Base | Representation |
---|---|
bin | 1110001010001100011… |
… | …0011011101011110001 |
3 | 212020212211100000222222 |
4 | 3202203012123223301 |
5 | 12441141130303131 |
6 | 303425525010425 |
7 | 23401034324441 |
oct | 3424306335361 |
9 | 766784300888 |
10 | 243254541041 |
11 | 94188935086 |
12 | 3b189553a15 |
13 | 19c28728565 |
14 | bab89d4121 |
15 | 64daa2e87b |
hex | 38a319baf1 |
243254541041 has 2 divisors, whose sum is σ = 243254541042. Its totient is φ = 243254541040.
The previous prime is 243254540941. The next prime is 243254541043. The reversal of 243254541041 is 140145452342.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 218559990016 + 24694551025 = 467504^2 + 157145^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-243254541041 is a prime.
Together with 243254541043, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 243254540992 and 243254541010.
It is not a weakly prime, because it can be changed into another prime (243254541043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121627270520 + 121627270521.
It is an arithmetic number, because the mean of its divisors is an integer number (121627270521).
Almost surely, 2243254541041 is an apocalyptic number.
It is an amenable number.
243254541041 is a deficient number, since it is larger than the sum of its proper divisors (1).
243254541041 is an equidigital number, since it uses as much as digits as its factorization.
243254541041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 76800, while the sum is 35.
Adding to 243254541041 its reverse (140145452342), we get a palindrome (383399993383).
The spelling of 243254541041 in words is "two hundred forty-three billion, two hundred fifty-four million, five hundred forty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •