Base | Representation |
---|---|
bin | 10010110011100011000000… |
… | …111000010001111011010101 |
3 | 101211211201112211110022010212 |
4 | 102303203000320101323111 |
5 | 41320033143303340431 |
6 | 451523043530455205 |
7 | 23264251455323015 |
oct | 2263430070217325 |
9 | 354751484408125 |
10 | 82707126230741 |
11 | 24397993650211 |
12 | 9339241294505 |
13 | 371c3300653ac |
14 | 165d090d63c45 |
15 | 98660741e72b |
hex | 4b38c0e11ed5 |
82707126230741 has 2 divisors, whose sum is σ = 82707126230742. Its totient is φ = 82707126230740.
The previous prime is 82707126230693. The next prime is 82707126230819. The reversal of 82707126230741 is 14703262170728.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 82658172455716 + 48953775025 = 9091654^2 + 221255^2 .
It is a cyclic number.
It is not a de Polignac number, because 82707126230741 - 222 = 82707122036437 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 82707126230741.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (82707126230441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 41353563115370 + 41353563115371.
It is an arithmetic number, because the mean of its divisors is an integer number (41353563115371).
Almost surely, 282707126230741 is an apocalyptic number.
It is an amenable number.
82707126230741 is a deficient number, since it is larger than the sum of its proper divisors (1).
82707126230741 is an equidigital number, since it uses as much as digits as its factorization.
82707126230741 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1580544, while the sum is 50.
The spelling of 82707126230741 in words is "eighty-two trillion, seven hundred seven billion, one hundred twenty-six million, two hundred thirty thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •