Base | Representation |
---|---|
bin | 1001001010010110011101… |
… | …1110011100100100111001 |
3 | 1022200000021221220102122011 |
4 | 2102211213132130210321 |
5 | 2310020343142444422 |
6 | 33231401041525521 |
7 | 2056532044101022 |
oct | 222454736344471 |
9 | 38600257812564 |
10 | 10073434343737 |
11 | 32341350893a6 |
12 | 11683709438a1 |
13 | 580bc7c61b1b |
14 | 26b7b1cd1c49 |
15 | 127076ce2077 |
hex | 9296779c939 |
10073434343737 has 2 divisors, whose sum is σ = 10073434343738. Its totient is φ = 10073434343736.
The previous prime is 10073434343699. The next prime is 10073434343779. The reversal of 10073434343737 is 73734343437001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6209520755881 + 3863913587856 = 2491891^2 + 1965684^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10073434343737 is a prime.
It is a super-2 number, since 2×100734343437372 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10073434323737) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5036717171868 + 5036717171869.
It is an arithmetic number, because the mean of its divisors is an integer number (5036717171869).
Almost surely, 210073434343737 is an apocalyptic number.
It is an amenable number.
10073434343737 is a deficient number, since it is larger than the sum of its proper divisors (1).
10073434343737 is an equidigital number, since it uses as much as digits as its factorization.
10073434343737 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5334336, while the sum is 49.
The spelling of 10073434343737 in words is "ten trillion, seventy-three billion, four hundred thirty-four million, three hundred forty-three thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •