Base | Representation |
---|---|
bin | 1001010100001111010100… |
… | …1000000000010100101101 |
3 | 1100021020210012111001201122 |
4 | 2111003311020000110231 |
5 | 2320311302011100221 |
6 | 33441414100150325 |
7 | 2105024612034335 |
oct | 225036510002455 |
9 | 40236705431648 |
10 | 10243314550061 |
11 | 329a19002582a |
12 | 11952813983a5 |
13 | 593c2c134b78 |
14 | 275ac9aa40c5 |
15 | 12b6bad77eab |
hex | 950f520052d |
10243314550061 has 2 divisors, whose sum is σ = 10243314550062. Its totient is φ = 10243314550060.
The previous prime is 10243314550043. The next prime is 10243314550111. The reversal of 10243314550061 is 16005541334201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7083417237961 + 3159897312100 = 2661469^2 + 1777610^2 .
It is a cyclic number.
It is not a de Polignac number, because 10243314550061 - 222 = 10243310355757 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10243314550961) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5121657275030 + 5121657275031.
It is an arithmetic number, because the mean of its divisors is an integer number (5121657275031).
Almost surely, 210243314550061 is an apocalyptic number.
It is an amenable number.
10243314550061 is a deficient number, since it is larger than the sum of its proper divisors (1).
10243314550061 is an equidigital number, since it uses as much as digits as its factorization.
10243314550061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43200, while the sum is 35.
Adding to 10243314550061 its reverse (16005541334201), we get a palindrome (26248855884262).
The spelling of 10243314550061 in words is "ten trillion, two hundred forty-three billion, three hundred fourteen million, five hundred fifty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •