Base | Representation |
---|---|
bin | 11010110101111111110000… |
… | …10101010111000101011001 |
3 | 21202000012111100122220022121 |
4 | 31122333320111113011121 |
5 | 30214121214341214243 |
6 | 325313543525221241 |
7 | 15301524666216661 |
oct | 1532777025270531 |
9 | 252005440586277 |
10 | 59029901898073 |
11 | 17899493795877 |
12 | 6754482861821 |
13 | 26c265a54a182 |
14 | 10810c36bd1a1 |
15 | 6c57835381ed |
hex | 35aff8557159 |
59029901898073 has 2 divisors, whose sum is σ = 59029901898074. Its totient is φ = 59029901898072.
The previous prime is 59029901898061. The next prime is 59029901898091. The reversal of 59029901898073 is 37089810992095.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 39929925294169 + 19099976603904 = 6319013^2 + 4370352^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-59029901898073 is a prime.
It is a super-2 number, since 2×590299018980732 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 59029901897993 and 59029901898011.
It is not a weakly prime, because it can be changed into another prime (59029901898013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 29514950949036 + 29514950949037.
It is an arithmetic number, because the mean of its divisors is an integer number (29514950949037).
Almost surely, 259029901898073 is an apocalyptic number.
It is an amenable number.
59029901898073 is a deficient number, since it is larger than the sum of its proper divisors (1).
59029901898073 is an equidigital number, since it uses as much as digits as its factorization.
59029901898073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 88179840, while the sum is 70.
The spelling of 59029901898073 in words is "fifty-nine trillion, twenty-nine billion, nine hundred one million, eight hundred ninety-eight thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •