Base | Representation |
---|---|
bin | 10000100111011110000000… |
… | …010110000101111101001111 |
3 | 100120202110220001201210011222 |
4 | 100213132000112011331033 |
5 | 34034324413041113110 |
6 | 415232542525433555 |
7 | 21251633563666046 |
oct | 2047360026057517 |
9 | 316673801653158 |
10 | 73081021816655 |
11 | 2131653a662956 |
12 | 824371240b8bb |
13 | 31a1684276b48 |
14 | 14091d70c355d |
15 | 86b012298c55 |
hex | 427780585f4f |
73081021816655 has 4 divisors (see below), whose sum is σ = 87697226179992. Its totient is φ = 58464817453320.
The previous prime is 73081021816651. The next prime is 73081021816661. The reversal of 73081021816655 is 55661812018037.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 73081021816655 - 22 = 73081021816651 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 73081021816597 and 73081021816606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (73081021816651) 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 in 3 ways as a sum of consecutive naturals, for example, 7308102181661 + ... + 7308102181670.
It is an arithmetic number, because the mean of its divisors is an integer number (21924306544998).
Almost surely, 273081021816655 is an apocalyptic number.
73081021816655 is a deficient number, since it is larger than the sum of its proper divisors (14616204363337).
73081021816655 is a wasteful number, since it uses less digits than its factorization.
73081021816655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14616204363336.
The product of its (nonzero) digits is 2419200, while the sum is 53.
The spelling of 73081021816655 in words is "seventy-three trillion, eighty-one billion, twenty-one million, eight hundred sixteen thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •