Base | Representation |
---|---|
bin | 100110101000100001… |
… | …0001111011000001101 |
3 | 21221010220020211102111 |
4 | 1031101002033120031 |
5 | 2324402230423042 |
6 | 102040232424021 |
7 | 5664631454641 |
oct | 1152102173015 |
9 | 257126224374 |
10 | 82963920397 |
11 | 32203a74376 |
12 | 140b4548011 |
13 | 7a921c6077 |
14 | 403066cc21 |
15 | 22587d7517 |
hex | 135108f60d |
82963920397 has 4 divisors (see below), whose sum is σ = 82966041180. Its totient is φ = 82961799616.
The previous prime is 82963920383. The next prime is 82963920433. The reversal of 82963920397 is 79302936928.
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 47355852996 + 35608067401 = 217614^2 + 188701^2 .
It is a cyclic number.
It is not a de Polignac number, because 82963920397 - 27 = 82963920269 is a prime.
It is a Smith number, since the sum of its digits (58) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (82963920497) 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, 1000588 + ... + 1080325.
It is an arithmetic number, because the mean of its divisors is an integer number (20741510295).
Almost surely, 282963920397 is an apocalyptic number.
It is an amenable number.
82963920397 is a deficient number, since it is larger than the sum of its proper divisors (2120783).
82963920397 is a wasteful number, since it uses less digits than its factorization.
82963920397 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2120782.
The product of its (nonzero) digits is 8817984, while the sum is 58.
The spelling of 82963920397 in words is "eighty-two billion, nine hundred sixty-three million, nine hundred twenty thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •