Base | Representation |
---|---|
bin | 1001000101000100111110… |
… | …0000110101110101010001 |
3 | 1022100100110010220120122122 |
4 | 2101101033200311311101 |
5 | 2302024323012130243 |
6 | 33122015155544025 |
7 | 2050144013654543 |
oct | 221211740656521 |
9 | 38310403816578 |
10 | 9982838005073 |
11 | 31a977489023a |
12 | 11528a82bb015 |
13 | 5754ba72663b |
14 | 267259b21693 |
15 | 124a2341c668 |
hex | 9144f835d51 |
9982838005073 has 4 divisors (see below), whose sum is σ = 10037991806388. Its totient is φ = 9927684203760.
The previous prime is 9982838005061. The next prime is 9982838005079. The reversal of 9982838005073 is 3705008382899.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 629345515969 + 9353492489104 = 793313^2 + 3058348^2 .
It is a cyclic number.
It is not a de Polignac number, because 9982838005073 - 210 = 9982838004049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 9982838004997 and 9982838005015.
It is not an unprimeable number, because it can be changed into a prime (9982838005079) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27576900386 + ... + 27576900747.
It is an arithmetic number, because the mean of its divisors is an integer number (2509497951597).
Almost surely, 29982838005073 is an apocalyptic number.
It is an amenable number.
9982838005073 is a deficient number, since it is larger than the sum of its proper divisors (55153801315).
9982838005073 is a wasteful number, since it uses less digits than its factorization.
9982838005073 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55153801314.
The product of its (nonzero) digits is 26127360, while the sum is 62.
The spelling of 9982838005073 in words is "nine trillion, nine hundred eighty-two billion, eight hundred thirty-eight million, five thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •