Base | Representation |
---|---|
bin | 10110110011111110001000… |
… | …01010110010001010100001 |
3 | 20120121122121100011112011022 |
4 | 23121333010022302022201 |
5 | 23033342302314224413 |
6 | 254405042153455225 |
7 | 13365146664244343 |
oct | 1331770412621241 |
9 | 216548540145138 |
10 | 50164214211233 |
11 | 14a90584164551 |
12 | 57621b1a11515 |
13 | 21cb607aa2bc5 |
14 | c55d64ab3293 |
15 | 5bed46587608 |
hex | 2d9fc42b22a1 |
50164214211233 has 2 divisors, whose sum is σ = 50164214211234. Its totient is φ = 50164214211232.
The previous prime is 50164214211149. The next prime is 50164214211257. The reversal of 50164214211233 is 33211241246105.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 42915234144784 + 7248980066449 = 6550972^2 + 2692393^2 .
It is a cyclic number.
It is not a de Polignac number, because 50164214211233 - 226 = 50164147102369 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 50164214211193 and 50164214211202.
It is not a weakly prime, because it can be changed into another prime (50164214211263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25082107105616 + 25082107105617.
It is an arithmetic number, because the mean of its divisors is an integer number (25082107105617).
Almost surely, 250164214211233 is an apocalyptic number.
It is an amenable number.
50164214211233 is a deficient number, since it is larger than the sum of its proper divisors (1).
50164214211233 is an equidigital number, since it uses as much as digits as its factorization.
50164214211233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 34560, while the sum is 35.
Adding to 50164214211233 its reverse (33211241246105), we get a palindrome (83375455457338).
The spelling of 50164214211233 in words is "fifty trillion, one hundred sixty-four billion, two hundred fourteen million, two hundred eleven thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.248 sec. • engine limits •