Base | Representation |
---|---|
bin | 100110101011001010… |
… | …0110000101001110111 |
3 | 21221101002020100011002 |
4 | 1031112110300221313 |
5 | 2330042440130432 |
6 | 102053122433515 |
7 | 6000056654654 |
oct | 1152624605167 |
9 | 257332210132 |
10 | 83052661367 |
11 | 3224a075815 |
12 | 1411a20289b |
13 | 7aa76c6c10 |
14 | 403c36cc2b |
15 | 22614b5e62 |
hex | 1356530a77 |
83052661367 has 4 divisors (see below), whose sum is σ = 89441327640. Its totient is φ = 76663995096.
The previous prime is 83052661337. The next prime is 83052661397. The reversal of 83052661367 is 76316625038.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 76316625038 = 2 ⋅38158312519.
It is an interprime number because it is at equal distance from previous prime (83052661337) and next prime (83052661397).
It is not a de Polignac number, because 83052661367 - 218 = 83052399223 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (83052661327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3194333117 + ... + 3194333142.
It is an arithmetic number, because the mean of its divisors is an integer number (22360331910).
Almost surely, 283052661367 is an apocalyptic number.
83052661367 is a deficient number, since it is larger than the sum of its proper divisors (6388666273).
83052661367 is a wasteful number, since it uses less digits than its factorization.
83052661367 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6388666272.
The product of its (nonzero) digits is 1088640, while the sum is 47.
The spelling of 83052661367 in words is "eighty-three billion, fifty-two million, six hundred sixty-one thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •