Base | Representation |
---|---|
bin | 10011000101011011100000… |
… | …101110111100110110000001 |
3 | 102000012012112122100011010001 |
4 | 103011123200232330312001 |
5 | 42000201432423141112 |
6 | 454303401553040001 |
7 | 23452114566145156 |
oct | 2305334056746601 |
9 | 360165478304101 |
10 | 83936021302657 |
11 | 248210808aa527 |
12 | 94b7443856001 |
13 | 37ab195b2a394 |
14 | 16a274cc7422d |
15 | 9a857dc27c57 |
hex | 4c56e0bbcd81 |
83936021302657 has 2 divisors, whose sum is σ = 83936021302658. Its totient is φ = 83936021302656.
The previous prime is 83936021302607. The next prime is 83936021302697. The reversal of 83936021302657 is 75620312063938.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 73965779312896 + 9970241989761 = 8600336^2 + 3157569^2 .
It is a cyclic number.
It is not a de Polignac number, because 83936021302657 - 223 = 83936012914049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 83936021302598 and 83936021302607.
It is not a weakly prime, because it can be changed into another prime (83936021302607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 41968010651328 + 41968010651329.
It is an arithmetic number, because the mean of its divisors is an integer number (41968010651329).
Almost surely, 283936021302657 is an apocalyptic number.
It is an amenable number.
83936021302657 is a deficient number, since it is larger than the sum of its proper divisors (1).
83936021302657 is an equidigital number, since it uses as much as digits as its factorization.
83936021302657 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9797760, while the sum is 55.
The spelling of 83936021302657 in words is "eighty-three trillion, nine hundred thirty-six billion, twenty-one million, three hundred two thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •