Base | Representation |
---|---|
bin | 110110111110010110… |
… | …011110001110001111 |
3 | 12122100202212001010122 |
4 | 312332112132032033 |
5 | 1431342200334342 |
6 | 43041145455155 |
7 | 4156525612301 |
oct | 667626361617 |
9 | 178322761118 |
10 | 59028136847 |
11 | 23040931979 |
12 | b5344a14bb |
13 | 57492c1c34 |
14 | 2bdd78b971 |
15 | 180727d4d2 |
hex | dbe59e38f |
59028136847 has 2 divisors, whose sum is σ = 59028136848. Its totient is φ = 59028136846.
The previous prime is 59028136829. The next prime is 59028136861. The reversal of 59028136847 is 74863182095.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 59028136847 - 210 = 59028135823 is a prime.
It is a congruent number.
It is a weakly prime.
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, 29514068423 + 29514068424.
It is an arithmetic number, because the mean of its divisors is an integer number (29514068424).
It is a 2-persistent number, because it is pandigital, and so is 2⋅59028136847 = 118056273694, but 3⋅59028136847 = 177084410541 is not.
Almost surely, 259028136847 is an apocalyptic number.
59028136847 is a deficient number, since it is larger than the sum of its proper divisors (1).
59028136847 is an equidigital number, since it uses as much as digits as its factorization.
59028136847 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2903040, while the sum is 53.
The spelling of 59028136847 in words is "fifty-nine billion, twenty-eight million, one hundred thirty-six thousand, eight hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •