Base | Representation |
---|---|
bin | 100110101000011011… |
… | …0111101000000011010 |
3 | 21221010200200111200000 |
4 | 1031100312331000122 |
5 | 2324401001232222 |
6 | 102040045153430 |
7 | 5664564352413 |
oct | 1152066750032 |
9 | 257120614600 |
10 | 82960961562 |
11 | 32202333356 |
12 | 140b355b876 |
13 | 7a916cb38b |
14 | 40300dc80a |
15 | 22584009ac |
hex | 1350dbd01a |
82960961562 has 48 divisors (see below), whose sum is σ = 196216980960. Its totient is φ = 26198195472.
The previous prime is 82960961539. The next prime is 82960961579. The reversal of 82960961562 is 26516906928.
It is a happy number.
82960961562 is a `hidden beast` number, since 8 + 29 + 609 + 6 + 1 + 5 + 6 + 2 = 666.
It is a super-2 number, since 2×829609615622 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 82960961499 and 82960961508.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 4482913 + ... + 4501380.
It is an arithmetic number, because the mean of its divisors is an integer number (4087853770).
Almost surely, 282960961562 is an apocalyptic number.
82960961562 is an abundant number, since it is smaller than the sum of its proper divisors (113256019398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
82960961562 is a wasteful number, since it uses less digits than its factorization.
82960961562 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8984329 (or 8984317 counting only the distinct ones).
The product of its (nonzero) digits is 2799360, while the sum is 54.
The spelling of 82960961562 in words is "eighty-two billion, nine hundred sixty million, nine hundred sixty-one thousand, five hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •