Base | Representation |
---|---|
bin | 11010110111001100001001… |
… | …01111100110000100010011 |
3 | 21202011010100102221201110201 |
4 | 31123212010233212010103 |
5 | 30220304212021303331 |
6 | 325344445200240031 |
7 | 15304506162626011 |
oct | 1533460457460423 |
9 | 252133312851421 |
10 | 59070912291091 |
11 | 17904919016068 |
12 | 6760409010017 |
13 | 26c6494a3830c |
14 | 10830941418b1 |
15 | 6c6883aa5a61 |
hex | 35b984be6113 |
59070912291091 has 2 divisors, whose sum is σ = 59070912291092. Its totient is φ = 59070912291090.
The previous prime is 59070912290989. The next prime is 59070912291109. The reversal of 59070912291091 is 19019221907095.
It is a happy number.
59070912291091 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (59070912291109) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 59070912291091 - 217 = 59070912160019 is a prime.
It is not a weakly prime, because it can be changed into another prime (59070982291091) 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, 29535456145545 + 29535456145546.
It is an arithmetic number, because the mean of its divisors is an integer number (29535456145546).
Almost surely, 259070912291091 is an apocalyptic number.
59070912291091 is a deficient number, since it is larger than the sum of its proper divisors (1).
59070912291091 is an equidigital number, since it uses as much as digits as its factorization.
59070912291091 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 918540, while the sum is 55.
The spelling of 59070912291091 in words is "fifty-nine trillion, seventy billion, nine hundred twelve million, two hundred ninety-one thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.718 sec. • engine limits •