Base | Representation |
---|---|
bin | 100110011001011010… |
… | …0001010011100100101 |
3 | 21212211120020012222201 |
4 | 1030302310022130211 |
5 | 2322332432214301 |
6 | 101514041454501 |
7 | 5646234126211 |
oct | 1146264123445 |
9 | 255746205881 |
10 | 82456913701 |
11 | 31a73861778 |
12 | 13b927a1431 |
13 | 7a111599c6 |
14 | 3dc31b1941 |
15 | 2229038201 |
hex | 1332d0a725 |
82456913701 has 2 divisors, whose sum is σ = 82456913702. Its totient is φ = 82456913700.
The previous prime is 82456913687. The next prime is 82456913729. The reversal of 82456913701 is 10731965428.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 74717489025 + 7739424676 = 273345^2 + 87974^2 .
It is a cyclic number.
It is not a de Polignac number, because 82456913701 - 27 = 82456913573 is a prime.
It is a super-3 number, since 3×824569137013 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (82456913741) 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 as a sum of consecutive naturals, namely, 41228456850 + 41228456851.
It is an arithmetic number, because the mean of its divisors is an integer number (41228456851).
It is a 1-persistent number, because it is pandigital, but 2⋅82456913701 = 164913827402 is not.
Almost surely, 282456913701 is an apocalyptic number.
It is an amenable number.
82456913701 is a deficient number, since it is larger than the sum of its proper divisors (1).
82456913701 is an equidigital number, since it uses as much as digits as its factorization.
82456913701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 46.
The spelling of 82456913701 in words is "eighty-two billion, four hundred fifty-six million, nine hundred thirteen thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •