Base | Representation |
---|---|
bin | 10000100110100001110110… |
… | …100011101111000110110001 |
3 | 100120112022011202200121021222 |
4 | 100212201312203233012301 |
5 | 34032300123334031343 |
6 | 415143141501354425 |
7 | 21244156165030115 |
oct | 2046416643570661 |
9 | 316468152617258 |
10 | 73016433111473 |
11 | 212a1105a58765 |
12 | 82330a7868a15 |
13 | 319855cc556b7 |
14 | 140602b033745 |
15 | 8694d1c84a68 |
hex | 4268768ef1b1 |
73016433111473 has 4 divisors (see below), whose sum is σ = 73464386689008. Its totient is φ = 72568479533940.
The previous prime is 73016433111463. The next prime is 73016433111493. The reversal of 73016433111473 is 37411133461037.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 73016433111473 - 216 = 73016433045937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (73016433111443) 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, 223976788523 + ... + 223976788848.
It is an arithmetic number, because the mean of its divisors is an integer number (18366096672252).
Almost surely, 273016433111473 is an apocalyptic number.
It is an amenable number.
73016433111473 is a deficient number, since it is larger than the sum of its proper divisors (447953577535).
73016433111473 is a wasteful number, since it uses less digits than its factorization.
73016433111473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 447953577534.
The product of its (nonzero) digits is 381024, while the sum is 44.
The spelling of 73016433111473 in words is "seventy-three trillion, sixteen billion, four hundred thirty-three million, one hundred eleven thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •