Base | Representation |
---|---|
bin | 10011110100101101… |
… | …10011001011010101 |
3 | 1000110201011210022101 |
4 | 21322112303023111 |
5 | 133244014403413 |
6 | 4520022402101 |
7 | 524510504254 |
oct | 117226631325 |
9 | 30421153271 |
10 | 10642731733 |
11 | 45715a9967 |
12 | 2090290331 |
13 | 1007bc80ca |
14 | 72d67079b |
15 | 42451bedd |
hex | 27a5b32d5 |
10642731733 has 2 divisors, whose sum is σ = 10642731734. Its totient is φ = 10642731732.
The previous prime is 10642731713. The next prime is 10642731739. The reversal of 10642731733 is 33713724601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10253182564 + 389549169 = 101258^2 + 19737^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10642731733 is a prime.
It is a super-2 number, since 2×106427317332 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10642731692 and 10642731701.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10642731739) 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, 5321365866 + 5321365867.
It is an arithmetic number, because the mean of its divisors is an integer number (5321365867).
Almost surely, 210642731733 is an apocalyptic number.
It is an amenable number.
10642731733 is a deficient number, since it is larger than the sum of its proper divisors (1).
10642731733 is an equidigital number, since it uses as much as digits as its factorization.
10642731733 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63504, while the sum is 37.
The spelling of 10642731733 in words is "ten billion, six hundred forty-two million, seven hundred thirty-one thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •