Base | Representation |
---|---|
bin | 10010101110101101011100… |
… | …100011000101110000011001 |
3 | 101210122221120121012020111221 |
4 | 102232231130203011300121 |
5 | 41244111422000104343 |
6 | 451110232340052041 |
7 | 23231243420102455 |
oct | 2256553443056031 |
9 | 353587517166457 |
10 | 82374730472473 |
11 | 24279a2193527a |
12 | 92a4936694021 |
13 | 36c6b9970c66a |
14 | 164ad5b53d665 |
15 | 97cb50b4c5ed |
hex | 4aeb5c8c5c19 |
82374730472473 has 2 divisors, whose sum is σ = 82374730472474. Its totient is φ = 82374730472472.
The previous prime is 82374730472471. The next prime is 82374730472479. The reversal of 82374730472473 is 37427403747328.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 77639219161344 + 4735511311129 = 8811312^2 + 2176123^2 .
It is a cyclic number.
It is not a de Polignac number, because 82374730472473 - 21 = 82374730472471 is a prime.
Together with 82374730472471, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (82374730472471) 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, 41187365236236 + 41187365236237.
It is an arithmetic number, because the mean of its divisors is an integer number (41187365236237).
Almost surely, 282374730472473 is an apocalyptic number.
It is an amenable number.
82374730472473 is a deficient number, since it is larger than the sum of its proper divisors (1).
82374730472473 is an equidigital number, since it uses as much as digits as its factorization.
82374730472473 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 132765696, while the sum is 61.
The spelling of 82374730472473 in words is "eighty-two trillion, three hundred seventy-four billion, seven hundred thirty million, four hundred seventy-two thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •