Base | Representation |
---|---|
bin | 110111010001100110000000… |
… | …111000111000100110100001 |
3 | 1011212202021201221001000111112 |
4 | 313101212000320320212201 |
5 | 223330434042204111244 |
6 | 2221011200341153105 |
7 | 102130340300152316 |
oct | 6721460070704641 |
9 | 1155667657030445 |
10 | 243101606316449 |
11 | 705068a3135551 |
12 | 233228780bb795 |
13 | a5854c9900a7a |
14 | 4406275512d0d |
15 | 1d1896d78539e |
hex | dd1980e389a1 |
243101606316449 has 2 divisors, whose sum is σ = 243101606316450. Its totient is φ = 243101606316448.
The previous prime is 243101606316433. The next prime is 243101606316467. The reversal of 243101606316449 is 944613606101342.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 241470839006224 + 1630767310225 = 15539332^2 + 1277015^2 .
It is a cyclic number.
It is not a de Polignac number, because 243101606316449 - 24 = 243101606316433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 243101606316397 and 243101606316406.
It is not a weakly prime, because it can be changed into another prime (243101606316479) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121550803158224 + 121550803158225.
It is an arithmetic number, because the mean of its divisors is an integer number (121550803158225).
Almost surely, 2243101606316449 is an apocalyptic number.
It is an amenable number.
243101606316449 is a deficient number, since it is larger than the sum of its proper divisors (1).
243101606316449 is an equidigital number, since it uses as much as digits as its factorization.
243101606316449 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2239488, while the sum is 50.
The spelling of 243101606316449 in words is "two hundred forty-three trillion, one hundred one billion, six hundred six million, three hundred sixteen thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •