Base | Representation |
---|---|
bin | 1001100101101000001000… |
… | …1000100001010111110101 |
3 | 1101022210211101222102122201 |
4 | 2121122002020201113311 |
5 | 2340210040423010214 |
6 | 34230535413424501 |
7 | 2135431256100004 |
oct | 231320210412765 |
9 | 41283741872581 |
10 | 10542033016309 |
11 | 33a493a897823 |
12 | 122314963b131 |
13 | 5b61565c2a82 |
14 | 286346930c3b |
15 | 134350c93274 |
hex | 996822215f5 |
10542033016309 has 2 divisors, whose sum is σ = 10542033016310. Its totient is φ = 10542033016308.
The previous prime is 10542033016253. The next prime is 10542033016327. The reversal of 10542033016309 is 90361033024501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10167584482225 + 374448534084 = 3188665^2 + 611922^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10542033016309 is a prime.
It is a super-2 number, since 2×105420330163092 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10542033016379) 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, 5271016508154 + 5271016508155.
It is an arithmetic number, because the mean of its divisors is an integer number (5271016508155).
Almost surely, 210542033016309 is an apocalyptic number.
It is an amenable number.
10542033016309 is a deficient number, since it is larger than the sum of its proper divisors (1).
10542033016309 is an equidigital number, since it uses as much as digits as its factorization.
10542033016309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 58320, while the sum is 37.
The spelling of 10542033016309 in words is "ten trillion, five hundred forty-two billion, thirty-three million, sixteen thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •