Base | Representation |
---|---|
bin | 1110001001011011101… |
… | …1000100001001001111 |
3 | 212020100120220012001002 |
4 | 3202112323010021033 |
5 | 12440231330000242 |
6 | 303353350010515 |
7 | 23363003622416 |
oct | 3422673041117 |
9 | 766316805032 |
10 | 243050234447 |
11 | 94093580559 |
12 | 3b131046a3b |
13 | 19bc52c3c97 |
14 | ba9981047d |
15 | 64c7b24432 |
hex | 3896ec424f |
243050234447 has 2 divisors, whose sum is σ = 243050234448. Its totient is φ = 243050234446.
The previous prime is 243050234429. The next prime is 243050234519. The reversal of 243050234447 is 744432050342.
243050234447 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 243050234447 - 210 = 243050233423 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 243050234447.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (243050234407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121525117223 + 121525117224.
It is an arithmetic number, because the mean of its divisors is an integer number (121525117224).
Almost surely, 2243050234447 is an apocalyptic number.
243050234447 is a deficient number, since it is larger than the sum of its proper divisors (1).
243050234447 is an equidigital number, since it uses as much as digits as its factorization.
243050234447 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 322560, while the sum is 38.
Adding to 243050234447 its reverse (744432050342), we get a palindrome (987482284789).
The spelling of 243050234447 in words is "two hundred forty-three billion, fifty million, two hundred thirty-four thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •