Base | Representation |
---|---|
bin | 100111010001100101… |
… | …0001111100101000001 |
3 | 22001200220212211102112 |
4 | 1032203022033211001 |
5 | 2340212442000311 |
6 | 102425052225105 |
7 | 6044032022051 |
oct | 1164312174501 |
9 | 261626784375 |
10 | 84341750081 |
11 | 328507a0196 |
12 | 14419a6b195 |
13 | 7c517b15c4 |
14 | 412164d561 |
15 | 22d974d28b |
hex | 13a328f941 |
84341750081 has 4 divisors (see below), whose sum is σ = 84364691412. Its totient is φ = 84318808752.
The previous prime is 84341750071. The next prime is 84341750093. The reversal of 84341750081 is 18005714348.
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 67444090000 + 16897660081 = 259700^2 + 129991^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-84341750081 is a prime.
It is a super-2 number, since 2×843417500812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (84341750011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11465150 + ... + 11472503.
It is an arithmetic number, because the mean of its divisors is an integer number (21091172853).
Almost surely, 284341750081 is an apocalyptic number.
It is an amenable number.
84341750081 is a deficient number, since it is larger than the sum of its proper divisors (22941331).
84341750081 is a wasteful number, since it uses less digits than its factorization.
84341750081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22941330.
The product of its (nonzero) digits is 107520, while the sum is 41.
The spelling of 84341750081 in words is "eighty-four billion, three hundred forty-one million, seven hundred fifty thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •