Base | Representation |
---|---|
bin | 110111001010011001… |
… | …011001101001000111 |
3 | 12122212212010111100101 |
4 | 313022121121221013 |
5 | 1432300414343421 |
6 | 43113205224531 |
7 | 4164531441352 |
oct | 671231315107 |
9 | 178785114311 |
10 | 59230231111 |
11 | 23134a15327 |
12 | b590102147 |
13 | 577c13053c |
14 | 2c1c557299 |
15 | 1819d9d191 |
hex | dca659a47 |
59230231111 has 2 divisors, whose sum is σ = 59230231112. Its totient is φ = 59230231110.
The previous prime is 59230231057. The next prime is 59230231121. The reversal of 59230231111 is 11113203295.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 59230231111 - 235 = 24870492743 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 59230231111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (59230231121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 29615115555 + 29615115556.
It is an arithmetic number, because the mean of its divisors is an integer number (29615115556).
Almost surely, 259230231111 is an apocalyptic number.
59230231111 is a deficient number, since it is larger than the sum of its proper divisors (1).
59230231111 is an equidigital number, since it uses as much as digits as its factorization.
59230231111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 28.
The spelling of 59230231111 in words is "fifty-nine billion, two hundred thirty million, two hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •