Base | Representation |
---|---|
bin | 110111110100001001… |
… | …101001100000100101 |
3 | 12201200200021021120101 |
4 | 313310021221200211 |
5 | 1440214232313434 |
6 | 43310511504101 |
7 | 4221065632462 |
oct | 676411514045 |
9 | 181620237511 |
10 | 59930744869 |
11 | 23464385716 |
12 | b746828031 |
13 | 58612bc718 |
14 | 2c875c6669 |
15 | 185b622b14 |
hex | df4269825 |
59930744869 has 2 divisors, whose sum is σ = 59930744870. Its totient is φ = 59930744868.
The previous prime is 59930744789. The next prime is 59930744891. The reversal of 59930744869 is 96844703995.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 51779002500 + 8151742369 = 227550^2 + 90287^2 .
It is a cyclic number.
It is not a de Polignac number, because 59930744869 - 217 = 59930613797 is a prime.
It is a super-2 number, since 2×599307448692 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 59930744869.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (59930744569) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 29965372434 + 29965372435.
It is an arithmetic number, because the mean of its divisors is an integer number (29965372435).
Almost surely, 259930744869 is an apocalyptic number.
It is an amenable number.
59930744869 is a deficient number, since it is larger than the sum of its proper divisors (1).
59930744869 is an equidigital number, since it uses as much as digits as its factorization.
59930744869 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 58786560, while the sum is 64.
The spelling of 59930744869 in words is "fifty-nine billion, nine hundred thirty million, seven hundred forty-four thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •