Base | Representation |
---|---|
bin | 110001101011111011… |
… | …010000010000111101 |
3 | 12002201002000012001001 |
4 | 301223323100100331 |
5 | 1333230134142111 |
6 | 40301522050301 |
7 | 3566033043226 |
oct | 615373202075 |
9 | 162632005031 |
10 | 53350302781 |
11 | 20697945126 |
12 | a40aaa9991 |
13 | 5052bb51c9 |
14 | 282168224d |
15 | 15c3a821c1 |
hex | c6bed043d |
53350302781 has 2 divisors, whose sum is σ = 53350302782. Its totient is φ = 53350302780.
The previous prime is 53350302743. The next prime is 53350302821. The reversal of 53350302781 is 18720305335.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 37390023225 + 15960279556 = 193365^2 + 126334^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53350302781 is a prime.
It is a super-2 number, since 2×533503027812 (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 53350302781.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53350309781) 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, 26675151390 + 26675151391.
It is an arithmetic number, because the mean of its divisors is an integer number (26675151391).
Almost surely, 253350302781 is an apocalyptic number.
It is an amenable number.
53350302781 is a deficient number, since it is larger than the sum of its proper divisors (1).
53350302781 is an equidigital number, since it uses as much as digits as its factorization.
53350302781 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75600, while the sum is 37.
The spelling of 53350302781 in words is "fifty-three billion, three hundred fifty million, three hundred two thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •