Base | Representation |
---|---|
bin | 1110110100101011110… |
… | …01110001100001000001 |
3 | 1210200122110111012111012 |
4 | 13122111321301201001 |
5 | 31321042144404022 |
6 | 1025551234330305 |
7 | 51540310562225 |
oct | 7322571614101 |
9 | 1720573435435 |
10 | 509321091137 |
11 | 187002529201 |
12 | 82862729995 |
13 | 3904b2a1b11 |
14 | 1a91913c785 |
15 | d3ae0d7de2 |
hex | 7695e71841 |
509321091137 has 2 divisors, whose sum is σ = 509321091138. Its totient is φ = 509321091136.
The previous prime is 509321091133. The next prime is 509321091151. The reversal of 509321091137 is 731190123905.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 280814146561 + 228506944576 = 529919^2 + 478024^2 .
It is a cyclic number.
It is not a de Polignac number, because 509321091137 - 22 = 509321091133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 509321091094 and 509321091103.
It is not a weakly prime, because it can be changed into another prime (509321091133) 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, 254660545568 + 254660545569.
It is an arithmetic number, because the mean of its divisors is an integer number (254660545569).
Almost surely, 2509321091137 is an apocalyptic number.
It is an amenable number.
509321091137 is a deficient number, since it is larger than the sum of its proper divisors (1).
509321091137 is an equidigital number, since it uses as much as digits as its factorization.
509321091137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51030, while the sum is 41.
The spelling of 509321091137 in words is "five hundred nine billion, three hundred twenty-one million, ninety-one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •