Base | Representation |
---|---|
bin | 10111000011000001100100… |
… | …10000100000011110101011 |
3 | 20122110002200220020221021011 |
4 | 23201200302100200132223 |
5 | 23120331111030442224 |
6 | 255442423503524351 |
7 | 13450420520634202 |
oct | 1341406220403653 |
9 | 218402626227234 |
10 | 50681457280939 |
11 | 1516a981410481 |
12 | 58264a55b96b7 |
13 | 223831939b1b4 |
14 | c72dd1daa239 |
15 | 5cd51ada8394 |
hex | 2e18324207ab |
50681457280939 has 2 divisors, whose sum is σ = 50681457280940. Its totient is φ = 50681457280938.
The previous prime is 50681457280921. The next prime is 50681457281113. The reversal of 50681457280939 is 93908275418605.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50681457280939 is a prime.
It is a super-2 number, since 2×506814572809392 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (50681457260939) 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, 25340728640469 + 25340728640470.
It is an arithmetic number, because the mean of its divisors is an integer number (25340728640470).
It is a 2-persistent number, because it is pandigital, and so is 2⋅50681457280939 = 101362914561878, but 3⋅50681457280939 = 152044371842817 is not.
Almost surely, 250681457280939 is an apocalyptic number.
50681457280939 is a deficient number, since it is larger than the sum of its proper divisors (1).
50681457280939 is an equidigital number, since it uses as much as digits as its factorization.
50681457280939 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 130636800, while the sum is 67.
The spelling of 50681457280939 in words is "fifty trillion, six hundred eighty-one billion, four hundred fifty-seven million, two hundred eighty thousand, nine hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •