Base | Representation |
---|---|
bin | 10010101110101101011100… |
… | …100011000101110000010111 |
3 | 101210122221120121012020111212 |
4 | 102232231130203011300113 |
5 | 41244111422000104341 |
6 | 451110232340052035 |
7 | 23231243420102453 |
oct | 2256553443056027 |
9 | 353587517166455 |
10 | 82374730472471 |
11 | 24279a21935278 |
12 | 92a493669401b |
13 | 36c6b9970c668 |
14 | 164ad5b53d663 |
15 | 97cb50b4c5eb |
hex | 4aeb5c8c5c17 |
82374730472471 has 2 divisors, whose sum is σ = 82374730472472. Its totient is φ = 82374730472470.
The previous prime is 82374730472467. The next prime is 82374730472473. The reversal of 82374730472471 is 17427403747328.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 82374730472471 - 22 = 82374730472467 is a prime.
It is a super-3 number, since 3×823747304724713 (a number of 43 digits) contains 333 as substring.
Together with 82374730472473, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 82374730472471.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (82374730472473) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 41187365236235 + 41187365236236.
It is an arithmetic number, because the mean of its divisors is an integer number (41187365236236).
Almost surely, 282374730472471 is an apocalyptic number.
82374730472471 is a deficient number, since it is larger than the sum of its proper divisors (1).
82374730472471 is an equidigital number, since it uses as much as digits as its factorization.
82374730472471 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 44255232, while the sum is 59.
The spelling of 82374730472471 in words is "eighty-two trillion, three hundred seventy-four billion, seven hundred thirty million, four hundred seventy-two thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •