Base | Representation |
---|---|
bin | 11010110111111111110000… |
… | …10101010111000101111111 |
3 | 21202020202212112111000120001 |
4 | 31123333320111113011333 |
5 | 30221232434032443342 |
6 | 325405310514135131 |
7 | 15306506634145525 |
oct | 1533777025270577 |
9 | 252222775430501 |
10 | 59098621374847 |
11 | 1791564808288a |
12 | 67658608814a7 |
13 | 26c8c8c5b8a72 |
14 | 1084562204315 |
15 | 6c74565048b7 |
hex | 35bff855717f |
59098621374847 has 2 divisors, whose sum is σ = 59098621374848. Its totient is φ = 59098621374846.
The previous prime is 59098621374739. The next prime is 59098621374869. The reversal of 59098621374847 is 74847312689095.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 59098621374847 - 223 = 59098612986239 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 59098621374847.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (59098621374547) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 29549310687423 + 29549310687424.
It is an arithmetic number, because the mean of its divisors is an integer number (29549310687424).
It is a 1-persistent number, because it is pandigital, but 2⋅59098621374847 = 118197242749694 is not.
Almost surely, 259098621374847 is an apocalyptic number.
59098621374847 is a deficient number, since it is larger than the sum of its proper divisors (1).
59098621374847 is an equidigital number, since it uses as much as digits as its factorization.
59098621374847 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 731566080, while the sum is 73.
The spelling of 59098621374847 in words is "fifty-nine trillion, ninety-eight billion, six hundred twenty-one million, three hundred seventy-four thousand, eight hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •