Base | Representation |
---|---|
bin | 10010111000101000101100… |
… | …100001110000011011010001 |
3 | 101220002011011220122220202211 |
4 | 102320220230201300123101 |
5 | 41341300334100213112 |
6 | 452351440052512121 |
7 | 23331441353466643 |
oct | 2270505441603321 |
9 | 356064156586684 |
10 | 83056824616657 |
11 | 24512224233421 |
12 | 9394b7661b641 |
13 | 37462c02bc338 |
14 | 1671d86722893 |
15 | 990772c460a7 |
hex | 4b8a2c8706d1 |
83056824616657 has 2 divisors, whose sum is σ = 83056824616658. Its totient is φ = 83056824616656.
The previous prime is 83056824616639. The next prime is 83056824616669. The reversal of 83056824616657 is 75661642865038.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 82497546489856 + 559278126801 = 9082816^2 + 747849^2 .
It is a cyclic number.
It is not a de Polignac number, because 83056824616657 - 211 = 83056824614609 is a prime.
It is a super-2 number, since 2×830568246166572 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 83056824616592 and 83056824616601.
It is not a weakly prime, because it can be changed into another prime (83056824316657) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 41528412308328 + 41528412308329.
It is an arithmetic number, because the mean of its divisors is an integer number (41528412308329).
Almost surely, 283056824616657 is an apocalyptic number.
It is an amenable number.
83056824616657 is a deficient number, since it is larger than the sum of its proper divisors (1).
83056824616657 is an equidigital number, since it uses as much as digits as its factorization.
83056824616657 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 348364800, while the sum is 67.
The spelling of 83056824616657 in words is "eighty-three trillion, fifty-six billion, eight hundred twenty-four million, six hundred sixteen thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •