Base | Representation |
---|---|
bin | 100110100111111100… |
… | …1010010100001010101 |
3 | 21221002120021020201112 |
4 | 1031033321102201111 |
5 | 2324332331444012 |
6 | 102034310504405 |
7 | 5664310065614 |
oct | 1151771224125 |
9 | 257076236645 |
10 | 82944796757 |
11 | 321a41a2509 |
12 | 140aa065105 |
13 | 7a8b25b7c4 |
14 | 402bcd187b |
15 | 2256cab122 |
hex | 134fe52855 |
82944796757 has 4 divisors (see below), whose sum is σ = 82945373196. Its totient is φ = 82944220320.
The previous prime is 82944796751. The next prime is 82944796769. The reversal of 82944796757 is 75769744928.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 42452893681 + 40491903076 = 206041^2 + 201226^2 .
It is a cyclic number.
It is not a de Polignac number, because 82944796757 - 24 = 82944796741 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 (82944796751) 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, 127313 + ... + 426729.
It is an arithmetic number, because the mean of its divisors is an integer number (20736343299).
Almost surely, 282944796757 is an apocalyptic number.
It is an amenable number.
82944796757 is a deficient number, since it is larger than the sum of its proper divisors (576439).
82944796757 is a wasteful number, since it uses less digits than its factorization.
82944796757 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 576438.
The product of its digits is 213373440, while the sum is 68.
The spelling of 82944796757 in words is "eighty-two billion, nine hundred forty-four million, seven hundred ninety-six thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •